Ex Machina [7 - 47]

The author intervenes. [54]

It is not just a game. [42]

Order as arbitrary. [47]

S↓E→3940414243444546474849505152535455
133433544433332333
222422434323321322
353623322342444244
431431344443344443
542543433443334533
633533434432332433
713422324331322312
824522434332422313
953423322223554255
1043444545443343544
1132444334334223442
1223433223323412331
1333432322332323422
1443533211231354454
1542334234242244354
1643543433443434533
1742342435542245554
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