Editing TwixT (section)

== Computational complexity for general rectangular boards ==
TwixT has been proven to be [[PSPACE-complete#Puzzles and games|PSPACE-complete]] for determining the game value, via a reduction from [[Hex (board game)|Hex]].<ref>{{Cite conference |first1=Édouard |last1=Bonnet |first2=Florian |last2=Jamain |first3=Abdallah |last3=Saffidine |title=Havannah and TwixT are PSPACE-complete |conference=The 8th Intl. Conf. on Computers and Games |location=Keio University, Yokohama, Japan |date=14 August 2013 |arxiv=1403.6518|doi=10.1007/978-3-319-09165-5_15}}</ref> TwixT has also been shown to be [[NP-complete]] regarding whether a single set of vertices can support a connecting path, via a reduction from [[Boolean satisfiability problem#3-satisfiability|3-satisfiability]].<ref>{{Cite web |author1=Dominic Mazzoni |author2=Kevin Watkins |title=Uncrossed knight paths is NP-complete |date=October 1997 |url=http://www.mathematik.uni-bielefeld.de/~sillke/PROBLEMS/Twixt_Proof_Draft}}</ref>
These proofs are indicative of a complex strategy: the game has not been [[Solved game|solved]], no winning strategy has been discovered, nor is the outcome of the game with [[perfect play]] known.
<!--
Number of "legal positions" and resultant "[[game-tree complexity]]"?
 -- see paper cited in "Computer opponents" section

Has it been "solved"? Can it be?  [[Solved game]]

possible "stock" phrase to use:
"Experts have not absolutely resolved what the outcome of a game will be where both sides use [[perfect play]]."

-->