liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Optimala strategier för whist
Linköping University, Department of Mathematics.
2004 (Swedish)Independent thesis Basic level (professional degree)Student thesis
Abstract [sv]

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.

Place, publisher, year, edition, pages
Matematiska institutionen , 2004. , 41 p.
Keyword [en]
Applied mathematics, minmax, alphabeta, game theory, whist,
Keyword [sv]
Tillämpad matematik
National Category
Computational Mathematics
URN: urn:nbn:se:liu:diva-2116ISRN: LITH-MAT-EX--03/18--SEOAI: diva2:19445
Available from: 2004-05-13 Created: 2004-05-13

Open Access in DiVA

fulltext(253 kB)636 downloads
File information
File name FULLTEXT01.pdfFile size 253 kBChecksum SHA-1
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 636 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 488 hits
ReferencesLink to record
Permanent link

Direct link