Selection Search for Mean and Temperature of Multi-Branch Combinatorial Games

Kao, Kuo Yuan; Wu, I‐Chen; Shan, Yi Cliang; Yen, Shi Jim

doi:10.3233/icg-2012-35303

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two forward search approaches for computing means and temperatures are known. Mean and Temperature Search (MTS) (Kao 2000;Kao et al 2012) searches a subgame in alternating-first order and refines bounds on means and temperatures up to convergence. The main limitation of MTS is the requirement that all game positions of temperature zero and below can be statically recognized and evaluated.…”

Section: Introductionmentioning

confidence: 99%

TDS+: Improving Temperature Discovery Search

Zhang

Müller

2015

AAAI

View full text Add to dashboard Cite

Temperature Discovery Search (TDS) is a forward search method for computing or approximating the temperature of a combinatorial game. Temperature and mean are important concepts in combinatorial game theory, which can be used to develop efficient algorithms for playing well in a sum of subgames. A new algorithm TDS+ with five enhancements of TDS is developed, which greatly speeds up both exact and approximate versions of TDS. Means and temperatures can be computed faster, and fixed-time approximations which are important for practical play can be computed with higher accuracy than before.

show abstract

Section: Introductionmentioning

confidence: 99%