Change search
ReferencesLink to record
Permanent link

Direct link
Evolutionary Tuning of Chess Playing Software
KTH, School of Engineering Sciences (SCI), Physics.
KTH, School of Engineering Sciences (SCI), Physics.
2013 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In the ambition to create intelligent computer players, the game of chess

is probably the most well-studied game. Much work has already been

done on producing good methods to search a chess game tree and to statically

evaluate chess positions. However, there is little consensus on how

to tune the parameters of a chess program’s search and evaluation functions.

What set of parameters makes the program play its strongest?

This paper attempts to answer this question by observing the results

of tuning a custom chess-playing implementation, called

Agent, using

genetic algorithms and evolutionary programming. We show not only

how such algorithms improve the program’s playing strength overall,

but we also compare the improved program’s strength to other versions

of Agent.


Place, publisher, year, edition, pages
2013. , 49 p.
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-126387OAI: diva2:642238
Available from: 2013-08-21 Created: 2013-08-21 Last updated: 2014-07-14Bibliographically approved

Open Access in DiVA

Jonah Schreiber, Philip Bramstång kandidatex.-rapport(1064 kB)394 downloads
File information
File name FULLTEXT01.pdfFile size 1064 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 394 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: 691 hits
ReferencesLink to record
Permanent link

Direct link