I'm scurrying off to look up Hamiltonin paths...in the meantime, any thoughts on my trying to use the regex engine to control the backtracking?
When you coded your N-Queens solution, was it easier or harder than a recursive subroutine? Would you do it again?
In reply to Re: Re: Detecting transpositions
by BrowserUk
in thread Detecting transpositions
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |