Jahn-Takeshi Saito

According to our database, Jahn-Takeshi Saito authored at least 6 papers between 2006 and 2012.

Collaborative distances:

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

2012

Game-Tree Search Using Proof Numbers: The First Twenty Years.

Akihiro Kishimoto, Mark H. M. Winands, Martin Müller, Jahn-Takeshi Saito

J. Int. Comput. Games Assoc., 2012

2010

Monte Carlo Tree Search in Lines of Action.

Mark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito

IEEE Trans. Comput. Intell. AI Games, 2010

Paranoid Proof-Number Search.

Jahn-Takeshi Saito, Mark H. M. Winands

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

2009

Randomized Parallel Proof-Number Search.

Jahn-Takeshi Saito, Mark H. M. Winands, H. Jaap van den Herik

Proceedings of the Advances in Computer Games, 12th International Conference, 2009

2008

Monte-Carlo Tree Search Solver.

Mark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito

Proceedings of the Computers and Games, 6th International Conference, CG 2008, Beijing, 2008

2006

Monte-Carlo Proof-Number Search for Computer Go.

Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M. Uiterwijk, H. Jaap van den Herik

Proceedings of the Computers and Games, 5th International Conference, 2006