Ex Machina [54 - 21]

It is not just a game. [42]

Order as arbitrary. [47]

A city of glass. [21]

S↓E→1314151617181920212223242526272829
4632434223243243442
4732434222143332332
4832433422313154344
4923331233233242231
5034131334334552234
5143233334233223343
5233222333322213334
5322232224242233222
5434223444332323322
5531323133322244433
5634322333225513335
5733133334432422233
5822223244333323323
5933423134244254532
6022232223322313342
6132333223243243332
6223212243344543224
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