Ex Machina [27 - 13]

that you need to live [16]

They are broken and repaired. [13]

S↓E→56789101112131415161718192021
1935432432112332043
2021435223344342504
2144543343223433140
2232442223333223313
2313445423233132424
2435543444314334243
2543323334344314424
2623445212342322424
2754443333233123443
2843245233343324534
2954652445435443332
3022445112343231413
3143445233233424433
3213545223233232524
3332434334332423314
3444433333223443132
3535434412122232444
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