Uncrossed Knight Paths is NP-complete
mathematik.uni-bielefeld.deDraft of a paper by Dominic Mazzoni and Kevin Watkins proving that finding paths in Twixt (i.e., whether it is still possible to win) is NP-complete.
Rate This Site
Embed Badge
Place this code on your website to show you're listed here.