Our maze is laid out on a two-dimensional grid, with the origin square (Row number 0, Column number 0) in the upper left, extending infinitely downward and to the right. (Thus, the row numbers and column numbers are numbers 0, 1, 2, 3, etc.)

To determine what type of block is at a given location (Row number R, Column number C), apply the following pseudocode (stop following the code once you've determined the block type):

Code: Select all

`if R=0:`

if C=0: Backward-slant

else: Top-T

if C=0: Left-T

if C is even: Forward-slant

if C is odd:

if C+2 is composite: Horizontal

if (R,C)=(1,1), or 2R-1 is prime: Vertical

else: Horizontal

Enter through the left side of square (0,0), and exit through the top of the same square.

If thou canst find, O Friend, a path through this maze, then go forth in triumph, for thou hast proven thyself worthy of everlasting glory.