inroad
发表于 2025-3-21 17:46:18
书目名称Computers and Games影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0234647<br><br> <br><br>书目名称Computers and Games读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0234647<br><br> <br><br>
STEER
发表于 2025-3-21 22:15:54
Human-Side Strategies in the Werewolf Game Against the Stealth Werewolf Strategy,limitation. The solution shows that the winning rates of the human-side are more than half when the number of werewolves is assigned as in common play. Since it is thought to be fair and interesting for the winning rate to stay near 50%, the result suggests that the “stealth werewolf” strategy is no
MELD
发表于 2025-3-22 01:38:09
Fast Seed-Learning Algorithms for Games,of these algorithms, namely rectangular algorithms (fully parallel) and bandit algorithms (faster in a sequential setup). We check the performance on several board games and card games. In addition, in the case of Go, we check the methodology when the opponent is completely distinct to the one used in the training.
Horizon
发表于 2025-3-22 05:10:12
http://reply.papertrans.cn/24/2347/234647/234647_4.png
manifestation
发表于 2025-3-22 09:18:50
https://doi.org/10.1007/978-3-642-40817-5 used not only as stand-alone players but also inside Monte Carlo Tree Search to select and bias moves. Using neural networks inside the tree search is a challenge due to their slow execution time even if accelerated on a GPU. In this paper we evaluate several strategies to limit the number of nodes
CAPE
发表于 2025-3-22 14:23:50
https://doi.org/10.1007/978-3-642-40817-5ieved remarkable success in Go and other games. However, recent studies on simple regret reveal that there are better exploration strategies. To further improve the performance, a leaf to be explored is determined not only by the mean but also by the whole reward distribution. We adopted a hybrid ap
CAPE
发表于 2025-3-22 17:08:22
http://reply.papertrans.cn/24/2347/234647/234647_7.png
紧张过度
发表于 2025-3-22 22:15:32
http://reply.papertrans.cn/24/2347/234647/234647_8.png
FRAUD
发表于 2025-3-23 05:11:43
http://reply.papertrans.cn/24/2347/234647/234647_9.png
incision
发表于 2025-3-23 08:09:16
https://doi.org/10.1007/978-3-642-40817-5t computer players for 2048 uses temporal difference learning (TD learning) with .-tuple networks, and it matters a great deal how to design .-tuple networks. In this paper, we study the .-tuple networks for the game 2048. In the first set of experiments, we conduct TD learning by selecting 6- and 7