Ex Machina [47 - 40]

A forest of fire. [30]

The machine copied, [40]

S↓E→3233343536373839404142434445464748
3944334350454343344
4014533424045343544
4135534445304333234
4234323444240232412
4332233332342023433
4435335164464401434
4544245253453410333
4644333254342412013
4733422443231332303
4834134355323323220
4933313244244221432
5033231245224334435
5134334343342221222
5223233343233132331
5323314333153121333
5433334422341132322
5543235433433332231
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