Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Pim Nijssen
Edit
0
6
…
2
Tags
people
researcher
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Pim Nijssen
Pim Nijssen
,
a Dutch computer scientist at
Department of Knowledge Engineering
[1]
,
Maastricht University
. His research interests include applying and improving
Monte-Carlo Tree Search
in
multiplayer games
such as
Focus
and
Chinese Checkers
, and
hide-and-seek
games like
Scotland Yard
.
Pim Nijssen
[2]
Table of Contents
Selected Publications
External Links
References
What links here?
Selected Publications
[3]
Pim Nijssen
(
2007
).
Playing Othello Using Monte Carlo
. Bachelor's Thesis,
Maastricht University
,
pdf
Pim Nijssen
(
2009
).
Using Intelligent Search Techniques to Play the Game Khet
. Master's Thesis,
Maastricht University
,
pdf
[4]
Pim Nijssen
,
Mark Winands
(
2010
).
Enhancements for Multi-Player Monte-Carlo Tree Search
.
CG 2010
,
pdf
Pim Nijssen
,
Mark Winands
(
2011
).
Playout Search for Monte-Carlo Tree Search in Multi-Player Games
.
Advances in Computer Games 13
,
pdf
Pim Nijssen
,
Mark Winands
(
2012
).
An Overview of Search Techniques in Multi-Player Games
.
ECAI CGW 2012
Pim Nijssen
,
Mark Winands
(
2012
).
Monte-Carlo Tree Search for the Hide-and-Seek Game Scotland Yard
.
IEEE Transactions on Computational Intelligence and AI in Games
Pim Nijssen
,
Mark Winands
(
2013
).
Search Policies in Multi-Player Games
.
ICGA Journal, Vol. 36, No. 1
Pim Nijssen
(
2013
).
Monte-Carlo Tree Search for Multi-Player Games
. Ph.D. thesis,
Maastricht University
,
pdf
[5]
External Links
Pim Nijssen - Games and AI Group
Pim Nijssen - Maastricht University
References
^
Maastricht University | Department of Knowledge Engineering
^
Pim Nijssen - Maastricht University
^
J. (Pim) A. M. Nijssen | Publications
^
Khet (game) from Wikipedia
^
Dap Hartmann
(
2014
).
From Monte Carlo to Scotland Yard.
ICGA Journal, Vol 37, No. 1
, Review on Pim Nijssen's Ph.D. thesis
What links here?
Page
Date Edited
Advances in Computer Games 13
Jan 7, 2017
CG 2010
Jan 8, 2014
Dap Hartmann
Jun 10, 2017
ECAI CGW 2012
May 21, 2015
Games
Feb 20, 2018
ICGA Journal
Dec 21, 2017
Maastricht University
May 15, 2017
Mark Winands
Sep 19, 2017
Mathematician
Apr 9, 2018
MCαβ
Jan 28, 2018
Monte-Carlo Tree Search
Apr 26, 2018
Othello
Jan 4, 2018
People
Feb 28, 2018
Pim Nijssen
May 21, 2015
Search
Feb 1, 2018
Up one level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
a Dutch computer scientist at Department of Knowledge Engineering [1], Maastricht University. His research interests include applying and improving Monte-Carlo Tree Search in multiplayer games such as Focus and Chinese Checkers, and hide-and-seek games like Scotland Yard.
Table of Contents
Selected Publications
[3]External Links
References
What links here?
Up one level