This paper by Laurens Kuiper shows that axis-parallel k-in-a-row is PSPACE-complete in complexity for k ≥ 5, but leaves the question open for k = 4. Has there been any research progress on this question?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy