J. (Pim) A. M. Nijssen

According to our database, J. (Pim) A. M. Nijssen authored at least 5 papers between 2010 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2013

Search Policies in Multi-Player Games.

J. (Pim) A. M. Nijssen, Mark H. M. Winands

J. Int. Comput. Games Assoc., 2013

2012

Monte Carlo Tree Search for the Hide-and-Seek Game Scotland Yard.

J. (Pim) A. M. Nijssen, Mark H. M. Winands

IEEE Trans. Comput. Intell. AI Games, 2012

2011

Monte-Carlo Tree Search for the game of Scotland Yard.

J. (Pim) A. M. Nijssen, Mark H. M. Winands

Proceedings of the 2011 IEEE Conference on Computational Intelligence and Games, 2011

Playout Search for Monte-Carlo Tree Search in Multi-player Games.

J. (Pim) A. M. Nijssen, Mark H. M. Winands

Proceedings of the Advances in Computer Games - 13th International Conference, 2011

2010

Enhancements for Multi-Player Monte-Carlo Tree Search.

J. (Pim) A. M. Nijssen, Mark H. M. Winands

Proceedings of the Computers and Games - 7th International Conference, 2010