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
Automatisk draggenerator för spel
KTH, School of Computer Science and Communication (CSC).
2013 (Swedish)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Automatic move generator for games (English)
Abstract [sv]

Målet med detta exjobb var att undersöka hur man kan skapa en draggenerator för spel definierade i ett predikatlogiskt språk, GDL. Draggeneratorn är tänkt att fungera som ett verktyg för att förvandla spelregler till spelträd som i sin tur kan automatiskt avsökas och analyseras av program för automatisk klassificering eller spelande.

GDL är snarlikt Prolog och draggeneratorn konstruerades på ett liknande sätt som man skulle ha gjort för en Prolog-interpretator. Det gjordes dock en mängd anpassningar, tillägg och optimeringar specifika för GDL.

Draggenerering är i mycket en imperativ process och att använda ett deklarativt, predikatlogiskt språk som GDL visar sig medföra prestandaproblem trots optimeringar och anpassningar.

Abstract [en]

The purpose of this project is to investigate how to create a move

generator for games defined in the predicate logic language GDL. The

move generator is supposed to be used as a tool for converting game

rules to playtrees that can be automatically traversed and analysed by

programs for classification and playing.

GDL is similar to Prolog so the move generator was implemented by

modification of a method to make a Prolog interpreter, though a number

of adaptations, additions and optimizations specific to GDL were made.

Move generation is a very iterative process, so using a declarative,

predicate logic language like GDL will be shown to have problems with

regards to performance, despite adaptations and optimizations.

Place, publisher, year, edition, pages
2013.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-142400OAI: oai:DiVA.org:kth-142400DiVA: diva2:700108
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2014-03-12 Created: 2014-03-03 Last updated: 2014-03-12Bibliographically approved

Open Access in DiVA

fulltext(1252 kB)89 downloads
File information
File name FULLTEXT01.pdfFile size 1252 kBChecksum SHA-512
4d0b6381d2b48145926f474212e533549185b8c7a329cdd51c66bf4ae288f8810d360b0d4c36a6c0fb13db584128bd96f692ade534e85c4bbac3e92b2005e021
Type fulltextMimetype application/pdf

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 89 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

urn-nbn

Altmetric score

urn-nbn
Total: 43 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