难受 发表于 2025-3-21 16:54:06

书目名称Computer Games影响因子(影响力)<br>        http://impactfactor.cn/if/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games影响因子(影响力)学科排名<br>        http://impactfactor.cn/ifr/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games网络公开度<br>        http://impactfactor.cn/at/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games网络公开度学科排名<br>        http://impactfactor.cn/atr/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games被引频次<br>        http://impactfactor.cn/tc/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games被引频次学科排名<br>        http://impactfactor.cn/tcr/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games年度引用<br>        http://impactfactor.cn/ii/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games年度引用学科排名<br>        http://impactfactor.cn/iir/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games读者反馈<br>        http://impactfactor.cn/5y/?ISSN=BK0233545<br><br>        <br><br>书目名称Computer Games读者反馈学科排名<br>        http://impactfactor.cn/5yr/?ISSN=BK0233545<br><br>        <br><br>

incubus 发表于 2025-3-21 21:05:07

http://reply.papertrans.cn/24/2336/233545/233545_2.png

玉米 发表于 2025-3-22 03:09:13

http://reply.papertrans.cn/24/2336/233545/233545_3.png

确保 发表于 2025-3-22 08:26:19

http://reply.papertrans.cn/24/2336/233545/233545_4.png

ERUPT 发表于 2025-3-22 11:28:15

Sequential Halving for Partially Observable Gameseering, and Phantom Go. Additionally, H-MCTS is studied, which uses Sequential Halving at the root of the search tree, and UCB elsewhere. Experimental results reveal that H-MCTS performs the best in Go Fish, whereas its performance is on par in Lost Cities and Phantom Domineering. Sequential Halving

harangue 发表于 2025-3-22 15:29:55

An Experimental Investigation on the Pancake Problem to the genome rearrangement problem also called sorting by reversals (SBR). The pancake problem is a NP-hard problem. Until now, the best theoretical R-approximation was 2 with an algorithm, which gives a 1.22 experimental R-approximation on stacks with a size inferior to 70. In the current work, w

harangue 发表于 2025-3-22 18:44:51

485 – A New Upper Bound for Morpion Solitaired of 485 moves. This is achieved in the following way: we encode Morpion 5T rules as a linear program and solve 126912 instances of this program on special octagonal boards. In order to show correctness of this method we analyze rules of the game and use a concept of a potential of a given position.

障碍物 发表于 2025-3-22 23:43:55

The Surakarta Bot Revealedtion five times, are revealed. The paper describes its .-based variable-depth search mechanism. Search enhancements such as multi-cut forward pruning and Realization Probability Search are shown to improve the agent considerably. Additionally, features of the static evaluation function are presented

LIMN 发表于 2025-3-23 05:12:21

http://reply.papertrans.cn/24/2336/233545/233545_9.png

很是迷惑 发表于 2025-3-23 08:56:06

http://reply.papertrans.cn/24/2336/233545/233545_10.png
页: [1] 2 3 4 5
查看完整版本: Titlebook: Computer Games; Fourth Workshop on C Tristan Cazenave,Mark H.M. Winands,Julian Togelius Conference proceedings 2016 Springer International