Ex Machina [22 - 17]

at random [4]

Reconsider your position. [17]

S↓E→910111213141516171819202122232425
1423343042233324124
1543233302332334444
1643421220344444343
1742233434035344344
1854122331213525454
1924321123320434234
2052233443425044554
2133432234331405345
2222233332233130334
2354232331324244053
2434443143342435205
2533343443144241440
2652123423224243453
2733332331234434434
2852333433245343352
2924454354433322426
3051123432314133554
Full Pathfinding Graph

Colophon

This online application automatically generates rule-abiding nonlinear readings of Ex Machina, as originally written by Jonathan Ball, whose first print edition was published by Book*Hug in 02009.

This literary stress-test assists in performing a qualitative analysis under the following hypothesis: nonlinear constructions of Ex Machina are semantically and poetically inferior to the first published linear construction. The methodology is adjustable due to lack of instruction in the original text, but the current simulation available is limited due to media porting instability. (In this case, a textuality deficiency with regards to physical media from the text's self-referential nature of itself being a printed and bounded book.)

The equivalent null-hypothesis would therefore state that rule-abiding nonlinear structures would make an equal or greater amount of sense as a linear reading of the original manuscript.

The methodology for this experiment uses an improvisation upon Edsger Dijkstra's graph-based pathfinding algorithm, unweighted. It accepts two parameters before running: starting location and desired ending location. It will then search for the shortest possible path between these two subsets. (Some possible sets of the same shortest length with different contents may exist.)


Return to Literature Index