( en | de | ru )

 

Disambiguation of "Tanaka, Tetsuro"

Author of the publication

copydeleteadd this publication to your clipboard
A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action Among Similar States

, and . ACG, volume 10664 of Lecture Notes in Computer Science, page 151-164. Springer, (2017)
DOI: 10.1007/978-3-319-71649-7_13

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tetsuro Samata

Masao Tanaka

Masafumi Tanaka

Shin Tanaka

Shu Tanaka

 

Other publications of authors with the same name

Infinite Connect-Four Is Solved: Draw., , , and . ACG, volume 7168 of Lecture Notes in Computer Science, page 208-219. Springer, (2011)An optimal MOO strategy.. CoRR, (2022)Testing the constrained controllability of discrete-time linear systems., , and . ECC, page 2370-2375. IEEE, (2001)Dual Lambda Search and Shogi Endgames., , and . ACG, volume 4250 of Lecture Notes in Computer Science, page 126-139. Springer, (2006)Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search., , and . ACG, volume 9525 of Lecture Notes in Computer Science, page 210-222. Springer, (2015)Human-Side Strategies in the Werewolf Game Against the Stealth Werewolf Strategy., and . Computers and Games, volume 10068 of Lecture Notes in Computer Science, page 93-102. Springer, (2016)A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action Among Similar States, and . ACG, volume 10664 of Lecture Notes in Computer Science, page 151-164. Springer, (2017)Testing the controllability of discrete-time linear systems with input constraints., , and . ECC, page 487-492. IEEE, (1999)Positive reachability of discrete-time linear systems., , and . ECC, page 3210-3215. IEEE, (2003)Cylinder-Infinite-Connect-Four Except for Widths 2, 6, and 11 Is Solved: Draw., , and . Computers and Games, volume 8427 of Lecture Notes in Computer Science, page 163-174. Springer, (2013)