Uncrossed Knight Paths is NP-complete

mathematik.uni-bielefeld.de
Visit Site

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.

Category
Twixt
Visits
185
Added
Jul 4, 2025
Rating
(3)
Rate This Site
QR Code
QR code Download PNG
Embed Badge
Place this code on your website to show you're listed here.
Get the best links delivered weekly — hand-picked from 1,200,810 resources