Ex Machina [42 - 10]

Order as arbitrary. [47]

A forest of fire. [30]

The machine conceived. [10]

S↓E→23456789101112131415161718
3422444433333223443
3534335434412122232
3644314444412233342
3733232543134344423
3824344134432342224
3924345434442122424
4044224354334344233
4143243553334344234
4222344433334333433
4332224234333331233
4432343542245435433
4541344651334324342
4621444431334324342
4711333322223324342
4833243543334324334
4942143442223233312
5034224545323341313
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