Difference between revisions of "Kunihito Hoki"

From Chessprogramming wiki
Jump to: navigation, search
Line 16: Line 16:
 
* [[Tomoyuki Kaneko]], [[Kunihito Hoki]] ('''2011'''). ''Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes''. [[Advances in Computer Games 13]]
 
* [[Tomoyuki Kaneko]], [[Kunihito Hoki]] ('''2011'''). ''Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes''. [[Advances in Computer Games 13]]
 
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]] ('''2011'''). ''The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search''. [[Advances in Computer Games 13]]
 
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]] ('''2011'''). ''The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search''. [[Advances in Computer Games 13]]
 +
* [[Kunihito Hoki]], [[Masakazu Muramatsu]]  ('''2012'''). ''[https://www.semanticscholar.org/paper/Efficiency-of-three-forward-pruning-techniques-in-Hoki-Muramatsu/206099961f401c8693e071c2b739f164ae5ffa6c Efficiency of three Forward-Pruning Techniques in Shogi: Futility Pruning, Null-move Pruning, and Late Move Reduction (LMR)]''. [https://www.journals.elsevier.com/entertainment-computing Entertainment Computing], Vol. 3, No. 3
 
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Takeshi Ito]] ('''2013'''). ''Parallel Dovetailing and its Application to Depth-First Proof-Number Search''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]] <ref>[https://en.wikipedia.org/wiki/Dovetailing_%28computer_science%29 Dovetailing (computer science) from Wikipedia]</ref>
 
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Takeshi Ito]] ('''2013'''). ''Parallel Dovetailing and its Application to Depth-First Proof-Number Search''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]] <ref>[https://en.wikipedia.org/wiki/Dovetailing_%28computer_science%29 Dovetailing (computer science) from Wikipedia]</ref>
 
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]], [[Daisaku Yokoyama]], [[Takuya Obata]], [[Hiroshi Yamashita]], [[Yoshimasa Tsuruoka]], [[Takeshi Ito]] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6598505/ A System-Design Outline of the Distributed-Shogi-System Akara 2010]''. [https://dblp.uni-trier.de/db/conf/snpd/snpd2013.html SNPD 2013]
 
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]], [[Daisaku Yokoyama]], [[Takuya Obata]], [[Hiroshi Yamashita]], [[Yoshimasa Tsuruoka]], [[Takeshi Ito]] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6598505/ A System-Design Outline of the Distributed-Shogi-System Akara 2010]''. [https://dblp.uni-trier.de/db/conf/snpd/snpd2013.html SNPD 2013]

Revision as of 21:42, 13 August 2018

Home * People * Kunihito Hoki

Kunihito Hoki [1]

Kunihito Hoki,
a Japanese chemist, computer scientist, and since 2010 Assistant Professor at the University of Electro-Communications. Kunihito Hoti received a D.Sc. in Chemistry from Tohoku University, and has been a research fellow at the University of Toronto as well as Tohoku University, where he then became Assistant Professor. As Shogi programmer, he is author of the strong Shogi program Bonanza, famous for its supervised move adaption tuning method called Minimax Tree Optimization (MMTO), also dubbed the Bonanza-Method. Kunihito Hoki further researched and published on Monte-Carlo Tree Search.


Selected Publications

[2]

2005 ...

2010 ...

2015 ...

External Links

References

Up one level