Ex Machina [40 - 27]

You continue, and break down. [27]

S↓E→1920212223242526272829303132333435
3252444552335140342
3331433423343234034
3413253343443234403
3544453443123332430
3653424544224332542
3742344353342342442
3843324413323433433
3935253443354434433
4053444433113241453
4142414454133343553
4233233343331233432
4333431422233313223
4433254254453433533
4524143165542424424
4623243243442234433
4722143332332123342
4822313154344343413
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