U
📝 描述
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.
⭐ 用户评价
暂无评价