3 citations · 11 across the 17 of their papers we have counts for
1 paper · 1 filter
R. Teal Witter
We study the computational complexity of the popular board game backgammon. We show that deciding whether a player can win from a given board configuration is NP-Hard, PSPACE-Hard,…