Unlike perfect-information games, imperfect-information games cannot be decomposed into subgames that are solved independently. Thus more computationally intensive equilibrium-finding techniques are used, and abstraction— in which a smaller version of the game is generated and solved—is essential. Endgame solving is the process of computing a (presumably) better strategy for just an endgame tha...

Long-term success for any tobacco endgame is contingent not only on acquiring political will, but also on sustaining it over a long period of time, perhaps even for decades. Future cohorts of public health professionals with knowledge of tobacco issues are therefore needed to carry on with the endgame strategy (should early attempts fail) and to keep tobacco control salient after an endgame str...

Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy to construct a large set of endgame heuristics. In this paper, we propose a conflict resolution strategy to eliminate the conflicts among the constructed heuristic database, which is called endgame knowledge base. In o...

Endgame databases have previously been built based on complete analysis of endgame positions. In the domain of Checkers, where endgame databases consisting of 39 trillion positions have already been built, it would be beneficial to be able to build select portions of even larger databases, without fully computing portions of the database that will almost never be needed. We present a new win-lo...

This article assesses the structural choices for the proposed tobacco endgame strategies. I focus on the issues associated with particular structural choices for the location of the implementation. Specifically, I discuss issues related to implementation of the endgame within a specific single agency, and issues related to a more widespread, broad implementation involving several agencies. Wher...

Dou Shou Qi is a game in which two players control a number of pieces, each of them aiming to move one of their pieces onto a given square. We implemented an engine for analyzing the game. Moreover, we created a series of endgame tablebases containing all configurations with up to four pieces. These tablebases are the first steps towards theoretically solving the game. Finally, we constructed d...

A reference model of fallible endgame play is defined in terms of a spectrum of endgame players whose play ranges in competence from random to optimal choice of move. They may be used as suitable practice partners, to differentiate between otherwise equi-optimal moves, to promote or expedite a result, to assess an opponent, to run Monte Carlo simulations, and to identify the difficulty of a pos...

The leading approach for computing strong game-theoretic strategies in large imperfect-information games is to first solve an abstracted version of the game offline, then perform a table lookup during game play. We consider a modification to this approach where we solve the portion of the game that we have actually reached in real time to a greater degree of accuracy than in the initial computa...

In this paper we describe a hybrid technique of Minimax search and aggregate Mahalanobis distance function synthesis to evolve Awale game player. The hybrid technique helps to suggest a move in a short amount of time without looking into endgame database. However, the effectiveness of the technique is heavily dependent on the training dataset of the Awale strategies utilized. The evolved player...