Ex Machina [53 - 3]

Incapable of satisfaction. [3]

S↓E→1234567891011121314151617
4534134465133432434
4632144443133432434
4731133332222332434
4823324354333432433
4934214344222323331
5023422454532334131
5132244532243443233
5232333433342333222
5323123434232322232
5433333513343234223
5523333421242331323
5612433443442334322
5731233521443333133
5823331412332222223
5923245554142333423
6022133432343322232
6122134443233432333
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