Ex Machina [64 - 20]

And believe that you see something. [47]

A forest of fire. [30]

Attendant or attending. [20]

S↓E→1213141516171819202122232425262728
4843243342231315434
4932333123323324223
5033413133433455223
5144323333423322334
5233322233332221333
5332223222424223322
5423422344433232332
5533132313332224443
5633432233322551333
5733313333443242223
5822222324433332332
5933342313424425453
6032223222332231334
6143233322324324333
6222321224334454322
6354455243425554345
6444354233325444344
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