Ex Machina [48 - 17]

Light behind the screen. [22]

at random [4]

Reconsider your position. [17]

S↓E→910111213141516171819202122232425
4043343442335344443
4133343442344241445
4233343334333323334
4343333312333343142
4422454354333325425
4513343243422414316
4613343243422324324
4722233243422214333
4833343243342231315
4922232333123323324
5053233413133433455
5124344323333423322
5234233322233332221
5323232223222424223
5434323422344433232
5524233132313332224
5644233432233322551
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