Intelligent Strategies for Several Zero-, One- and Two-Player Games
Résumé
In this paper we present efficient and intelligent strategies for several zero-, one- and two-player games. Most of the games have been studied before or are related to other well-known games, but we present improved algorithmic techniques for playing them optimally. The main techniques we employed are dynamic programming, the Sprague-Grundy game theory and pattern extraction. We also make use of elements from computational geometry, like orthogonal range searching data structures.
Fichier principal
0_1_2_player_games.pdf (94.52 Ko)
Télécharger le fichier
M_I_Andreica-Int_Strategies_0_1_2_Player_Games.ppt (576.5 Ko)
Télécharger le fichier
related_materials.zip (20.97 Mo)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre
Format : Autre
Loading...