Ex Machina [59 - 22]

An infinity of strings, harps without angels. [9]

A consuming fire. [29]

What you will never know. [48]

Light behind the screen. [22]

S↓E→1415161718192021222324252627282930
4824334223131543443
4933312332332422313
5041313343345522343
5132333342332233433
5232223333222133343
5322322242422332223
5442234443323233223
5513231333222444334
5643223332255133353
5731333344324222333
5822232443333233233
5934231342442545323
6022322233223133423
6123332232432433322
6232122433445432242
6345524342555434543
6435423332544434432
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