Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
