Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Constructing an Evaluation Function for Playing Backgammon.
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2011 (English)Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In this project we describe a few variations of the game backgammon. We explain different algorithms, used to play backgammon and other similar games, and develop our own rule engine and a set of players. By developing an evaluation function for playing board games, we aim to find out if it's possible to construct a simple computerized player that outperforms other players, and which properties such a player should have. The player programs that we have developed are very primitive, but there are distinct tendencies revealing which players dominate the others. The winning player's only strategy is to hit the opponent's lone checkers, while protecting its own.

Abstract [sv]

I denna uppsats beskriver vi några varianter av spelet backgammon. Vi går igenom olika algoritmer som används för att spela backgammon och andra liknande spel, och utvecklar vår egen regelmotor och en uppsättning spelare. Vi vill skapa en evalueringsfunktion för att spela brädspel så att vi ska kunna ta reda på om det går att konstruera en enkel datorspelare som vinner över andra spelare, och vilka egenskaper en sådan spelare ska ha. Spelarprogrammen som vi utvecklat är mycket primitiva, men det är ändå tydligt vilka spelare som tenderar att dominiera andra. Den vinnande spelaren har som sin enda strategi att slå ut motståndarens ensamma pjäser, medan den skyddar sina egna.

Place, publisher, year, edition, pages
2011.
Series
Kandidatexjobb CSC, K11069
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-130864OAI: oai:DiVA.org:kth-130864DiVA: diva2:654309
Educational program
Master of Science in Engineering - Computer Science and Technology
Uppsok
Technology
Supervisors
Examiners
Available from: 2013-10-07 Created: 2013-10-07

Open Access in DiVA

No full text

Other links

http://www.csc.kth.se/utbildning/kandidatexjobb/datateknik/2011/rapport/sjoqvist_anders_OCH_stenlund_andre_K11069.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 10 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf