Rule Examples of
Determined Unicursal Paths

These are examples of Rules for Determined Unicursal Path Generation.

RULE #1

A candidate point must exist in the direction that the path is facing.

Rule Order #1

RULE #2

A candidate point CAN NOT be the exit point IF there are ANY non-exit points in the field that have not yet been entered.

Rule Order #2

RULE #3

A candidate point CAN NOT be entered more than once.

Rule Order #3

RULE #4

A candidate point CAN NOT be entered if there are ANY other candidate points that are non-exit points that have only one exit path remaining.

Rule Order #4

RULE #5

A candidate point CAN NOT be entered if it removes the last exit path to the exit point BEFORE all other non-exit points have been entered.

Rule Order #5

RULE #6

A candidate point CAN NOT be entered if ALL of the following conditions exist:

  1. The start point is either an interior or exterior point.
  2. IF the start point IS NOT an exterior point, this rule may only be disregarded once.
  3. There are non-entered, non-exit points that are COLLINEAR on the opposing axis to the candidate point.
  4. The path is blocked in the same direction beyond the candidate point for the following reasons:
    1. There are no points.
    2. There is an exit point.
    3. There is an occupied non-exit point.

Rule Order #6

RULE #7

A candidate point CAN NOT be entered if ALL of the following conditions exist:

  1. The candidate point is directly diagonal to, in any direction, a point already entered or an exit point ("opposition point A").
  2. The candidate point is directly beside, both on the vertical and horizontal axis, to non-entered non-exit points ("opposition points B & C").
  3. "Opposition Point A" MUST ALSO be beside, both on the vertical and horizontal axis, these same points ("opposition points B & C").

Rule Order #7

RULE #8

???