scientific article; zbMATH DE number 598464
From MaRDI portal
Publication:4299345
Recommendations
Cited in
(19)- Global and local game tree search
- On the number of go positions on lattice graphs
- A diceless game of the classic and finite hyper dice backgammon: a new class of Partizan Combinatorial Games
- Complexity, appeal and challenges of combinatorial games
- Remarks on history and presence of game tree search and research
- Combinatorial games modeling seki in Go
- Computer Go
- A finite set of functions with an EXPTIME-complete composition problem
- Preface
- Recent results and questions in combinatorial game complexities
- Symmetric and non-symmetric mixed games: games with a combination of chance and no chance
- Book review of: E. R. Berlekamp et al., Winning ways for your mathematical plays.
- A hierarchical approach to computer Hex
- The Go polynomials of a graph.
- Entrepreneurial chess
- Coin-sliding and Go
- Static analysis based on formal models and incremental computation in Go programming
- Extended thermography for multiple kos in Go
- scientific article; zbMATH DE number 16388 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299345)