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. Two algorithms where examined. The minmax algorithm and the alphbeta algorithm. these algorithms could be adapted to whist It is possible that there are methods that use the properties of the cards better the the former algorithms to get an optimal result. A few such methods will also be discussed. The practical result of the theoretical investigation was a game where the adapted algorithms were implemented.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-2116 |
| Date | January 2004 |
| Creators | Eiderbrant, Emanuel |
| Publisher | Linköpings universitet, Matematiska institutionen, Matematiska institutionen |
| Source Sets | DiVA Archive at Upsalla University |
| Language | Swedish |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0017 seconds