Deriving strategies from perfect play

Title
Deriving strategies from perfect play

Topic
A number of games have been solved: Checkers, Nine-men’s morris,
Connect-Four, Go-Moku, Awari. This means that perfect play in these
games is available. Some of these games have been solved with a
knowledge based approach. Some with a brute-force approach. Now the
question is what this means for human
play: can we learn form these perfect lines of play. Can a
knowledge-based approach be found by mining the brute force data? Is it possible to
summarize easy to remember rules of thumb? Is it possible to summarize
or generalize concepts form these perfect strategies? This topic
involves artificial intelligence, machine learning, concept learning,
generalization, and, in a sense learn the ultimate compression method
for (some of) these games.

Company/Organization
LIACS intern

Student Profile
CS/AI

Time frame
Negotiable

Scientific Challenge
Machine learning of game playing concepts

Advisor
Walter Kosters
Jan van Rijn
Aske Plaat

Information: aske.plaat@gmail.com

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s