A master thesis from Aalborg University
Asymmetric Game Tree using a Dynamic Bayesian Network
Author(s)
Term
4. term
Education
Publication year
2008
Submitted on
2012-02-14
Abstract
This project we improve mini max search by rediciting which move the opponent is most likely to take. This prediction is performed by using a dynamic bayesian network. This network has nodes that represents a number of abstract features extracted from the game. The network is trained sing EM-learning based on data from a number of comptuter players playing against each other. These computer players are defined as the weighted sum of the features mentioned before. These weights are found using a genetic approach. The system is able to improve performance of the worst strategies without increasing the search space.
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.