1 link
Uncrossed Knight Paths is NP-complete
mathematik.uni-bielefeld.de
Draft 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.