Ex Machina [28 - 43]

In the garden of forking paths, you appear always to move forward. [4]

The illuminated book, painted with metal and bound in skin. [43]

S↓E→3536373839404142434445464748495051
2032544234454554334
2135452362343334354
2223344213223124324
2323433243354434424
2434355453422224245
2523243323334233333
2631343223344444413
2724335354332433144
2824313244244455344
2945364434421331446
3031434124444444323
3124341254244455444
3222445234454435424
3342352332244433415
3433254342312314344
3503434144343334223
3620534115444344333
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