Ex Machina [34 - 11]

(is) lack of recourse [47]

A forest of fire. [30]

The machine's needs. [11]

S↓E→345678910111213141516171819
2633234452123423224
2732544433332331234
2841432452333433245
2923546524454354433
3043224451123432314
3141434452332334244
3244135452232332325
3323324343343324233
3424444333332234431
3543354344121222324
3643144444122333425
3732325431343444234
3843441344323422244
3943454344421224243
4042243543343442335
4132435533343442344
4223444333343334333
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