Sök:

Sökresultat:

2 Uppsatser om Minmax - Sida 1 av 1

Optimala strategier för whist

Whist is one of the most played card games of the world. Though there have been many studies made in the field of game theory, whist is still somewhat of an unchartered territory. In this thesis some methods to obtain an optimal strategy for whist are discussed. Whist belongs to a group of games called logical games. For this group there exists algorithms which result in an optimal strategy.

AI för Hive

Strategies for the board game Hive was implemented and evaluated in this project. The report covers the rules as well as the system that was implemented in order to build strategies. The strategies are evaluated based on how they perform against each other. Two search algorithms were implemented: Minmax and Alpha-Beta Pruning. Alpha-Beta with depth 4 had the best performance against other strategies as well as in individual tests..