Change search
ReferencesLink to record
Permanent link

Direct link
AI för Hive
KTH, School of Computer Science and Communication (CSC).
2014 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

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.

Abstract [sv]

I projektet implementerades och utvärderades strategier för brädspelet Hive.Rapporten går igenom regler samt systemet som implementerades för att kunna skapa strategier. Strategierna utvärderas baserat på hur de presterar mot varandra. Två sökalgoritmer implementerades: Minmax och Alpha-Beta Pruning. Alpha-Beta med djup 4 presterade bäst mot andra strategier samti individuella tester.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-157411OAI: diva2:769908
Available from: 2014-12-09 Created: 2014-12-09 Last updated: 2014-12-09Bibliographically approved

Open Access in DiVA

fulltext(792 kB)16 downloads
File information
File name FULLTEXT01.pdfFile size 792 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

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

Direct link