Ex Machina [48 - 38]

Light behind the screen. [22]

and recombining [62]

The pages of the book. [16]

As you turn the pages,



























paths cleave, encountering your immobile form. [28]

But in fact it is the garden that moves. [38]

S↓E→3031323334353637383940414243444546
4024145334240453435
4134355344453043332
4223343234442402324
4331322333323420234
4443353351644644014
4542442452534534103
4623443332543424120
4712334224432313323
4834341343553233232
4933333132442442214
5034332312452243344
5133343343433422212
5232232333432331323
5332233143331531213
5432333344223411323
5544432354334333322
5633244333442344453
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