A Much Faster Way to check a Notation's "Drawability"

To summarise what was proved in the previous page: a notation is drawable if and only if the shadow it would denote does not violate the Jordan Curve Theorem. This requires checking up to 3^{2N}/2 pairs of loops.

There is a much faster way however to check a notation's drawability. Instead of considering each possible notation and doing the full calculations on all pairs of loops, one performs Equal Drawability moves on the notation. In other words, one replaces the notation under consideration by another notation such that either both are drawable or none of them. It is possible (in fact almost certain) that by performing such moves one eventually arrives to a notation that has already been checked. By applying such a procedure the whole program was accelerated by a factor of a hundred.

The equal drawability moves should not be confused with the reidemeister moves; while the latter are performed on the full projection, the former are performed on the shadow. And while the latter replace a knot with a topologically equivalent one, the former replace a shadow not by an equivalent one, but merely by one that is as drawable as the previous one. There are three kinds of "equal drawability" moves: