Previously I wrote a proof that a certain generalization of the game Abalone, extended to a board of arbitrary size and with the "gutters" no long constrained to be along the edges, was PSPACE-hard. I could not show that it lies in PSPACE, only EXPTIME, so it called out for continuation. This repository is a compilation of my notes toward potentially establishing that the problem is in fact EXPTIME-hard, which would imply that it was EXPTIME-complete, joining Chess as games in that class.
jkopczyn/ABALONE
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published