Go Complexities - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Go Complexities

Abstract

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.
Fichier principal
Vignette du fichier
gocomplexities_draft.pdf (1.04 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01256660 , version 1 (15-01-2016)

Identifiers

Cite

Abdallah Saffidine, Olivier Teytaud, Shi-Jim Yen. Go Complexities. Advances in Computer Games, 2015, Leiden, Netherlands. ⟨10.1007/978-3-319-27992-3_8⟩. ⟨hal-01256660⟩
500 View
516 Download

Altmetric

Share

Gmail Facebook X LinkedIn More