NEW APPROXIMATE STRATEGIES FOR PLAYING SUM GAMES BASED ON SUBGAME TYPES

Article type: Research Article

Authors: Zaky, Manal M. | Andraos, Cherif R. S. | Ghoneim, Salma A.¹

Affiliations: Cairo, Egypt

Note: [1] Ain Shams University, Cairo, Egypt. Email: manalmourad@yahoo.com, cherif.andraos@ieee.org, salma_ghoneim@hotmail.com

Abstract: In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing sum games based on subgame types. Two new approximate strategies are developed and tested using a specified game model. Both strategies achieve higher performance than approximate strategies previously proposed in the literature without being computationally more expensive.

DOI: 10.3233/ICG-2006-29403

Journal: ICGA Journal, vol. 29, no. 4, pp. 191-198, 2006