Ex Machina [46 - 19]

Shameful. [3]

Please be aware of these risks. [19]

S↓E→1112131415161718192021222324252627
3832342224433244133
3942122424352534433
4034344233534444331
4134344234424144541
4234333433332333433
4333331233334314222
4445435433332542544
4534324342241431655
4634324342232432434
4723324342221433323
4834324334223131543
4923233312332332422
5023341313343345522
5134432333342332233
5223332223333222133
5323222322242422332
5432342234443323233
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