Ex Machina [46 - 29]

Trying to tell you something. [9]

A consuming fire. [29]

S↓E→2122232425262728293031323334353637
3832441332343343343
3925344335443443343
4044443311324145334
4141445413334355344
4223334333123343234
4343142223331322333
4425425445343353351
4514316554242442452
4624324344223443332
4714333233212334224
4831315434434341343
4923324223133333132
5033455223434332312
5123322334333343343
5232221333432232333
5324223322232233143
5433232332232333344
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