Testing the controllability of discrete-time linear systems with input constraints. - Hiroshi Yoshida; Tetsuro Tanaka; Kazutomo Yunokuchi (ECC, 1999)

Report on the IPSJ-SIG-GI Workshop in Hamamatsu. - Tetsuro Tanaka (J. Int. Comput. Games Assoc., 2000)

Testing the constrained controllability of discrete-time linear systems. - Hiroshi Yoshida; Tetsuro Tanaka; Kazutomo Yunokuchi (ECC, 2001)

Positive reachability of discrete-time linear systems. - Hiroshi Yoshida; Tetsuro Tanaka; Kazutomo Yunokuchi (ECC, 2003)

Dual Lambda Search and Shogi Endgames. - Shunsuke Soeda; Tomoyuki Kaneko; Tetsuro Tanaka (ACG, 2006)

Positive Controllability Test for Continuous-Time Linear Systems. - Hiroshi Yoshida; Tetsuro Tanaka (IEEE Trans. Autom. Control., 2007)

Infinite Connect-Four Is Solved: Draw. - Yoshiaki Yamaguchi; Kazunori Yamaguchi; Tetsuro Tanaka; Tomoyuki Kaneko (ACG, 2011)

Cylinder-Infinite-Connect-Four Except for Widths 2, 6, and 11 Is Solved: Draw. - Yoshiaki Yamaguchi; Tetsuro Tanaka; Kazunori Yamaguchi (Computers and Games, 2013)

Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search. - Shu Yokoyama; Tomoyuki Kaneko; Tetsuro Tanaka (ACG, 2015)

Human-Side Strategies in the Werewolf Game Against the Stealth Werewolf Strategy. - Xiaoheng Bi; Tetsuro Tanaka (Computers and Games, 2016)

A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action Among Similar States. - Katsuki Ohto; Tetsuro Tanaka (ACG, 2017)

An optimal MOO strategy. - Tetsuro Tanaka (CoRR, 2022)

Estimating the number of reachable positions in Minishogi. - Sotaro Ishii; Tetsuro Tanaka (CoRR, 2024)