Ex Machina [62 - 25]

The pages of the book. [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
4834223131543443434
4912332332422313333
5013343345522343433
5133342332233433334
5223333222133343223
5322242422332223223
5434443323233223233
5531333222444334443
5623332255133353324
5733344324222333233
5832443333233233334
5931342442545323345
6022233223133423233
6132232432433322334
6222433445432242314
6324342555434543354
6423332544434432344
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