| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 434.96 KB | Adobe PDF |
Orientador(es)
Resumo(s)
We consider bounds for the temperatures of combinatorial games. Our first result gives an upper bound on the temperatures of the positions of a ruleset in terms of the lengths of the confusion intervals of these positions. We give an example to show that this bound is tight. Our second main result is a method to find a bound for the lengths of the confusion intervals. This pair of results constitutes the first general technique to bound temperatures. As examples of the bound and the method, we consider the temperature of subsets of positions in DOMINEERING and SNORT.
Descrição
Palavras-chave
Combinatorial game Temperature Boiling point Domineering Snort
Contexto Educativo
Citação
HUNTEMANN, Svenja; NOWAKOWSKI, Richard J.; SANTOS, Carlos Pereira dos – Bounding game temperature using confusion intervals. Theoretical Computer Science. ISSN 0304-3975. Vol. 855 (2021), pp. 43-60
Editora
Elsevier