Ex Machina [49 - 34]

If only I knew what you wanted. [29]

What you will never know. [48]

The eyes, windows. [34]

S↓E→2627282930313233343536373839404142
4141333435534445304
4233312334323444240
4322333132233332342
4444534335335164464
4555424244245253453
4634422344333254342
4723321233422443231
4843443434134355323
4922313333313244244
5022343433231245224
5133433334334343342
5233343223233343233
5332223223314333153
5433223233334422341
5544334443235433433
5633353324433344234
5722333233223432342
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