Web Directory
 

Uncrossed Knight Paths is NP-complete

  Link Details for: Uncrossed Knight Paths is NP-complete
Link Title: Uncrossed Knight Paths is NP-complete Open in a new window
Link URL: http://www.mathematik.uni-bielefeld.de/~sillke/PROBLEMS/Twixt_Proof_Draft
Link Details: 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: Top : Games : Board_Games : Abstract : Connection_Games : Twixt
Link Type: Lock this listing - So it can't be removedLock this listing - and upgrade it to FeaturedReport this listingAdd a regular link to the same category
ScreenShot:
Uncrossed Knight Paths is NP-complete