Ex Machina [30 - 45]

The machine copied, [40]

You continue, and break down. [27]

The water [49]

If only I could fashion it. [45]

S↓E→3738394041424344454647484950515253
2234421322312432444
2343324335443442454
2435545342222424543
2524332333423333324
2634322334444441344
2733535433243314445
2831324424445534445
2936443442133144654
3043412444444432345
3134125424445544445
3244523445443542455
3335233224443341543
3425434231231434432
3543414434333422345
3653411544434433345
3705535533254314545
3830233334334423334
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