Ex Machina [27 - 25]

that you need to live [16]

As you turn the pages,



























paths cleave, encountering your immobile form. [28]

But in fact it is the garden that moves. [38]

If allowed this far, perhaps further. [25]

S↓E→1718192021222324252627282930313233
1932043423433323333
2042504455422341433
2133140534544434144
2223313033432332324
2332424405343243421
2434243520544433443
2514424144023443433
2622424345303341331
2723443443430224444
2824534335233044334
2943332242654504345
3031413355412240322
3124433535433354034
3232524445523351403
3323314334233432340
3443132533434432344
3532444534431233324
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