Go Complexities
Résumé
The game of Go is often said to exptime-complete. The result refers to classical Go under Japanese rules, but many variants of the problem exist and affect the complexity. We survey what is known on the computational complexity of Go and highlight challenging open problems. We also propose a few new results. In particular, we show that Atari-Go is pspace-complete and that hardness results for classical Go carry over to their Partially Observable variant.
Domaines
Optimisation et contrôle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...