Ex Machina [34 - 26]

(is) lack of recourse [47]

A forest of fire. [30]

The machine needed. [26]

S↓E→1819202122232425262728293031323334
2624243453033413313
2734434434302244444
2845343352330443344
2933322426545043452
3014133554122403224
3144335354333540344
3225244455233514034
3333143342334323403
3431325334344323440
3524445344312333243
3625342454422433254
3734234435334234244
3844332441332343343
3943525344335443443
4035344443311324145
4144241445413334355
4233323334333123343
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