Ex Machina [53 - 35]

How mother would always cry. [35]

S↓E→2728293031323334353637383940414243
4554242442452534534
4644223443332543424
4733212334224432313
4834434341343553233
4923133333132442442
5023434332312452243
5134333343343433422
5233432232333432331
5322232233143331531
5432232333344223411
5543344432354334333
5633533244333442344
5723332332234323421
5832333343242223433
5953233453443444534
6034232333343413311
6133223343233442412
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