Ex Machina [7 - 4]

It is all a dream. [28]

In the garden of forking paths, you appear always to move forward. [4]

S↓E→1234567891011121314151617
101324432433433441
230244521452323333
323033554342321323
443303234512323231
523440643451212223
631331032411223323
723323403333123112
834434510444234223
933244554044542444
1042442143502334434
1123433533440133323
1233322422333032333
1342333532343101133
1443222454233430422
1533333454432333023
1643424433434212203
1744413345422334340
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