Ex Machina [6 - 13]

Something torn apart, into separate parts. [5]

Read the instruction and decode it. [13]

S↓E→56789101112131415161718192021
144324334334414241
245214523233333344
335543423213231143
432345123232313425
506434512122231453
610324112233232424
734033331231123343
845104442342234454
945540445424443343
1021435023344343515
1135334401333231443
1224223330323332443
1335323431011333343
1424542334304223332
1534544323330233233
1644334342122034444
1733454223343403534
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