標(biāo)題: Titlebook: Computers and Games; Third International Jonathan Schaeffer,Martin Müller,Yngvi Bj?rnsson Conference proceedings 2003 Springer-Verlag Berl [打印本頁] 作者: 脾氣好 時(shí)間: 2025-3-21 16:29
書目名稱Computers and Games影響因子(影響力)
書目名稱Computers and Games影響因子(影響力)學(xué)科排名
書目名稱Computers and Games網(wǎng)絡(luò)公開度
書目名稱Computers and Games網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computers and Games被引頻次
書目名稱Computers and Games被引頻次學(xué)科排名
書目名稱Computers and Games年度引用
書目名稱Computers and Games年度引用學(xué)科排名
書目名稱Computers and Games讀者反饋
書目名稱Computers and Games讀者反饋學(xué)科排名
作者: 影響帶來 時(shí)間: 2025-3-21 22:36 作者: 構(gòu)想 時(shí)間: 2025-3-22 02:25 作者: fluffy 時(shí)間: 2025-3-22 07:56 作者: heart-murmur 時(shí)間: 2025-3-22 09:24 作者: 廚師 時(shí)間: 2025-3-22 15:58
Polyarteritis nodosa: clinical aspectse stone if and only if the number of stones is not a multiple of three, and otherwise it can be reduced to two stones. But in general it is NP-complete to decide whether an arbitrary Clobber configuration can be reduced to a single stone.作者: 廚師 時(shí)間: 2025-3-22 19:20 作者: insincerity 時(shí)間: 2025-3-22 22:45
Signals and Communication Technologyvarious aspects of a game that are learned through experience. An automated computer player is developed without any initial strategy and is able to learn important strategic aspects of the game through self-play by storing pattern-weights and using temporal difference learning.作者: 爭吵加 時(shí)間: 2025-3-23 05:27
Signals and Communication Technologyescribe techniques for selecting from the set of all legal moves a small subset of moves for look-ahead evaluation, eliminating all other moves from consideration. We then study the effects of these techniques experimentally and show which have the most potential for producing the best Amazons-playing program.作者: pus840 時(shí)間: 2025-3-23 09:30 作者: apiary 時(shí)間: 2025-3-23 12:40
Investigation of an Adaptive Cribbage Player opponent. This additional hand is referred to as the crib or box and is scored alternatively by you and your opponent. In this work, we investigate how a strategy can be evolved that decides which cards should be discarded into the crib. Several methods are investigated with the best one being compared against a commercially available program.作者: 四牛在彎曲 時(shí)間: 2025-3-23 14:12 作者: 前兆 時(shí)間: 2025-3-23 19:59
Solitaire Clobbere stone if and only if the number of stones is not a multiple of three, and otherwise it can be reduced to two stones. But in general it is NP-complete to decide whether an arbitrary Clobber configuration can be reduced to a single stone.作者: 積極詞匯 時(shí)間: 2025-3-24 00:25
Signals and Communication Technologyearning methods, experimental results and comparisons are presented and discussed. These results demonstrate the advantages and drawbacks of existing learning approaches in strategy games and the potential of the new algorithm.作者: 身心疲憊 時(shí)間: 2025-3-24 03:40 作者: 出處 時(shí)間: 2025-3-24 07:58 作者: Resign 時(shí)間: 2025-3-24 12:16 作者: 終端 時(shí)間: 2025-3-24 18:12 作者: SYN 時(shí)間: 2025-3-24 20:11 作者: 珠寶 時(shí)間: 2025-3-25 03:04
,(,): A Self-teaching Algorithm that Achieved Master-Strength at Othelloearning methods, experimental results and comparisons are presented and discussed. These results demonstrate the advantages and drawbacks of existing learning approaches in strategy games and the potential of the new algorithm.作者: Folklore 時(shí)間: 2025-3-25 03:21 作者: decode 時(shí)間: 2025-3-25 07:32
The Neural MoveMap Heuristic in Chessce of existing game databases and opening theory on the design of the training patterns. The NMM heuristic is tested for middle-game chess positions by the program .. The experimental results indicate that the NMM heuristic outperforms the existing move ordering, especially when a weighted-combination approach is chosen.作者: Sleep-Paralysis 時(shí)間: 2025-3-25 11:59 作者: 無價(jià)值 時(shí)間: 2025-3-25 16:50
Position-Value Representation in Opening Booksa position. As a solution we introduce three new value types: the . and ., which propagate additional information when the opening book contains positions with value . and ., which propagates additional information when the opening book contains cycles which lead to a position repetition.作者: 好忠告人 時(shí)間: 2025-3-25 20:38
ORTS: A Hack-Free RTS Game Environmente provides efficient C++ implementations for 2D object motion and collision detection, visibility computation, and incremental server-client data synchronization, as well as connectivity to the Generic Game Server (GGS). It is therefore well suited as a platform for RTS related A.I. research.作者: 灰心喪氣 時(shí)間: 2025-3-26 01:38 作者: Ruptured-Disk 時(shí)間: 2025-3-26 08:13 作者: Finasteride 時(shí)間: 2025-3-26 09:21
Conference proceedings 2003games as the experimental test-bed. The ?rst two CG conferences were held at Hamamatsu,Japan(1998,2000).ComputersandGames2002(CG2002)wasthe third event in this biennial series. The conference was held at the University of Alberta(Edmonton,Alberta,Canada),July25–27,2002.Theprogramconsisted of the mai作者: BLAND 時(shí)間: 2025-3-26 14:31 作者: Sarcoma 時(shí)間: 2025-3-26 19:55
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234643.jpg作者: Accord 時(shí)間: 2025-3-26 23:05
The Variational Approach to Fracture player’s moves to those of a baseline strategy with known expected winnings. This allows an accurate estimate of the player’s expectation to be found hundreds of times faster than the naive approach of using the average winnings observed as an estimate.作者: 絆住 時(shí)間: 2025-3-27 01:19
Signals and Communication Technologys, a new learning algorithm .(.) (........) has been developed. . uses a heuristic model of past experience to improve generalization and reduce noisy estimations. The algorithm was able to tune the parameter vector of a huge linear system consisting of about 1.5 million parameters and to end up at 作者: NOVA 時(shí)間: 2025-3-27 05:32 作者: Cosmopolitan 時(shí)間: 2025-3-27 11:23
Signals and Communication TechnologyDiplomacy. Diplomacy is a multi-player, zero-sum and simultaneous move game with imperfect information. Pattern-weights represent stored knowledge of various aspects of a game that are learned through experience. An automated computer player is developed without any initial strategy and is able to l作者: Offbeat 時(shí)間: 2025-3-27 17:04 作者: 錯(cuò)誤 時(shí)間: 2025-3-27 19:13 作者: SOB 時(shí)間: 2025-3-27 23:34
https://doi.org/10.1007/3-540-28820-1other theoretical limitations of the max. algorithm, namely that tie-breaking strategies are crucial to max., and that zero-window search is not possible in max. game trees. We also present quantitative results derived from playing max. and the paranoid algorithm (Sturtevant and Korf, 2000) against 作者: Muscularis 時(shí)間: 2025-3-28 05:00 作者: 拖債 時(shí)間: 2025-3-28 08:41
https://doi.org/10.1007/3-540-28820-1al. An instructive example is 3-Hirn, where two programs each make one proposal and a human boss has the final choice between them. In chess, Go, and several other brain games, many experiments with 3-Hirn and other settings proved the usefulness of multiple choice systems and the validity of the un作者: 單調(diào)性 時(shí)間: 2025-3-28 12:16
Microscopic polyarteritis (MPA)ng heuristic in chess, namely the Neural MoveMap (NMM) heuristic. The heuristic uses a neural network to estimate the likelihood of a move being the best in a certain position. The moves considered more likely to be the best are examined first. We develop an enhanced approach to apply the NMM heuris作者: 赤字 時(shí)間: 2025-3-28 16:45
L. Mouthon,F. Lhote,L. Guillevins) the classic approach of building a large opening book of known positions is infeasible. In this paper, we present a different approach for opening and middle game play in shogi. This method uses board maps that assign values to each square for each piece in a number of different formations. Hill-作者: Tincture 時(shí)間: 2025-3-28 21:03
Polyarteritis nodosa: clinical aspectsas possible from the board by alternating white and black moves. We show that a . stone checkerboard configuration on a single row (or single column) can be reduced to about ./4 stones. For boards with at least two rows and columns, we show that a checkerboard configuration can be reduced to a singl作者: countenance 時(shí)間: 2025-3-28 23:17
https://doi.org/10.1007/BFb0017656are the size and distance of the code, respectively. This is done by using the theory of combinatorial games, specifically, two-player cellular automata games. Previous algorithms were exponential in ..作者: indubitable 時(shí)間: 2025-3-29 05:46 作者: 不適當(dāng) 時(shí)間: 2025-3-29 10:18 作者: Heresy 時(shí)間: 2025-3-29 13:00
https://doi.org/10.1007/BFb0017656tage of this set of values is that propagation is efficient and that the propagated information is sufficient for selecting a move in the root position. In this paper we propose a new position-value representation which is suited for the use in opening books. In an opening book, propagation speed is作者: contradict 時(shí)間: 2025-3-29 18:14
https://doi.org/10.1007/BFb0017656all terminal win or loss positions, i.e., those that are either checkmate or stalemate, and then propagates the values back to their predecessors until no further propagation is possible. The un-propagated positions are then declared draws..However, in Chinese chess, there are special rules other th作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-29 19:44 作者: 考博 時(shí)間: 2025-3-30 00:27
Computers and Games978-3-540-40031-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: atopic-rhinitis 時(shí)間: 2025-3-30 06:52
The Variational Approach to Fracture player’s moves to those of a baseline strategy with known expected winnings. This allows an accurate estimate of the player’s expectation to be found hundreds of times faster than the naive approach of using the average winnings observed as an estimate.作者: Patrimony 時(shí)間: 2025-3-30 08:38 作者: 惡心 時(shí)間: 2025-3-30 14:33
https://doi.org/10.1007/BFb0017656are the size and distance of the code, respectively. This is done by using the theory of combinatorial games, specifically, two-player cellular automata games. Previous algorithms were exponential in ..作者: 無瑕疵 時(shí)間: 2025-3-30 17:51
https://doi.org/10.1007/BFb0017656ending a similar but smaller catalog in Table E.10, Appendix E of the book . [1]..The major surprises of our present work include the following.It is hoped that these results may someday provide the basis for further new insights and generalizations.作者: dictator 時(shí)間: 2025-3-31 00:31
https://doi.org/10.1007/b94154Computer; algorithmic learning; algorithms; calculus; combinatorics; complexity; computer games; computers 作者: 拱形大橋 時(shí)間: 2025-3-31 04:15
978-3-540-20545-6Springer-Verlag Berlin Heidelberg 2003作者: Ondines-curse 時(shí)間: 2025-3-31 07:11 作者: 悠然 時(shí)間: 2025-3-31 09:50
Playing Games with Multiple Choice Systemsal. An instructive example is 3-Hirn, where two programs each make one proposal and a human boss has the final choice between them. In chess, Go, and several other brain games, many experiments with 3-Hirn and other settings proved the usefulness of multiple choice systems and the validity of the underlying ideas.作者: ANNUL 時(shí)間: 2025-3-31 14:30 作者: 鴿子 時(shí)間: 2025-3-31 20:55 作者: 積習(xí)已深 時(shí)間: 2025-4-1 01:24
Signals and Communication TechnologyA new algorithm based on threat analysis is proposed. It can model existing related algorithms such as Lambda Search and Abstract Proof Search. It solves 6x6 AtariGo much faster than previous algorithms. It can be used in other games. Theoretical and experimental comparisons with other related algorithms are given.作者: 紅潤 時(shí)間: 2025-4-1 04:32
A Generalized Threats Search AlgorithmA new algorithm based on threat analysis is proposed. It can model existing related algorithms such as Lambda Search and Abstract Proof Search. It solves 6x6 AtariGo much faster than previous algorithms. It can be used in other games. Theoretical and experimental comparisons with other related algorithms are given.作者: 有害 時(shí)間: 2025-4-1 09:25 作者: spondylosis 時(shí)間: 2025-4-1 14:04
,(,): A Self-teaching Algorithm that Achieved Master-Strength at Othellos, a new learning algorithm .(.) (........) has been developed. . uses a heuristic model of past experience to improve generalization and reduce noisy estimations. The algorithm was able to tune the parameter vector of a huge linear system consisting of about 1.5 million parameters and to end up at
