Ex Machina [47 - 31]

A city of glass. [21]

[F]ACE [31]

S↓E→2324252627282930313233343536373839
3934433544344334350
4044331132414533424
4144541333435534445
4233433312334323444
4314222333132233332
4442544534335335164
4531655424244245253
4632434422344333254
4733323321233422443
4831543443434134355
4932422313333313244
5045522343433231245
5132233433334334343
5222133343223233343
5322332223223314333
5423233223233334422
5522444334443235433
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