Monte Carlo tree search in Kriegspiel-Reference-Cited by-同舟云学术

Monte Carlo tree search in Kriegspiel

Published:2010-07 Issue:11 Volume:174 Page:670-684
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Ciancarini Paolo,Favini Gian Piero

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference21 articles.

1. A Phantom Go program;Cazenave,2005

2. Theory of Games and Economic Behavior;von Neumann,1944

3. A. Parker, D. Nau, V. Subrahmanian, Game-tree search with combinatorially large belief states, in: Proc. 19th Int. Joint Conf. on Artificial Intelligence (IJCAI05), Edinburgh, Scotland, 2005, pp. 254–259

4. P. Ciancarini, G. Favini, Representing Kriegspiel states with metapositions, in: Proc. 20th Int. Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad, India, 2007, pp. 2450–2455

5. Solving kriegspiel-like problems: Exploiting a transposition table;Sakuta;ICCA Journal,2000

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Red Team automated testing modeling and online planning method for post-penetration;Computers & Security;2024-09

2. An Integrated Approach of Learning Genetic Networks From Genome-Wide Gene Expression Data Using Gaussian Graphical Model and Monte Carlo Method;Bioinformatics and Biology Insights;2023-01

3. Combining Monte-Carlo Tree Search with Proof-Number Search;2022 IEEE Conference on Games (CoG);2022-08-21

4. On the Complexity of Dark Chinese Chess;2022 34th Chinese Control and Decision Conference (CCDC);2022-08-15

5. Nim variants;ICGA Journal;2022-07-05