Ex Machina [3 - 28]

Acknowledge the potential for failure. [18]

Concurrent Read Exclusive Write [16]

As you turn the pages,



























paths cleave, encountering your immobile form. [28]

S↓E→2021222324252627282930313233343536
141444323443243423
244333242334334314
343523544334443435
425425322243223313
553534432344334314
624444341333325424
743333222123233223
854434333234344334
943331544413444234
1015555432442414533
1143444443353225443
1243333344344144335
1343423322433233233
1432412433323332324
1533444411332422132
1644434333144344334
1734434413332332422
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