Ex Machina [61 - 30]

A brief moment when all seems possible. [47]

A forest of fire. [30]

S↓E→2223242526272829303132333435363738
4813154344343413435
4933242231333331324
5034552234343323124
5133223343333433434
5222213334322323334
5342233222322331433
5432323322323333442
5522244433444323543
5625513335332443334
5732422233323322343
5833323323333432422
5944254532334534434
6022313342323333434
6143243332233432334
6244543224231433233
6355543454335453435
6454443443234453335
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