Advances in Computer Games
-15%
portes grátis
Advances in Computer Games
15th International Conferences, ACG 2017, Leiden, The Netherlands, July 3-5, 2017, Revised Selected Papers
van den Herik, H. Jaap; Kosters, Walter A.; Winands, Mark H.M.
Springer International Publishing AG
12/2017
235
Mole
Inglês
9783319716480
15 a 20 dias
454
Descrição não disponível.
Analytical Solution for "EinStein wuerfelt nicht!" with One Stone.- Toward Solving EinStein wuerfelt nicht!.- Analysis of Fred Horn's Gloop Puzzle.- Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy Playing Hanabi Near-Optimally Optimal Play of the Farkle Dice GameDeep df-pn and its Efficient Implementations.- Improved Policy Networks for Computer Go.- Exploring Positional Linear Go.- Influence of Search Depth on Position Evaluation.- Evaluating Chess-like Games Using Generated Natural Language Descriptions.- Machine Learning in the Game of Breakthrough.- A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action among Similar States.- Exploration Bonuses Based on Upper Confidence Bounds for Sparse Developing a 2048 Player with Backward Temporal Coherence Learning and Restart.- A Little Bit of Frustration Can Go a Long Way.- Automated Adaptation and Assessment in Serious Games: A Portable Tool for Supporting Learning.- An Analysis of Majority Voting in Homogeneous Groups for Checkers: Understanding Group Performance through Unbalance.- Yasol: An Open Source Solver for Quantified Mixed Integer Programs.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
artificial intelligence;combinatorial game;complexity;distributed computing;evaluation function;game tree search;general game playing;heuristic function constructions;inductive logic programming;Markov decision progress;mchine learning;optimization;parallel search;planning and scheduling;random walk;realtime;reinforcement learning;search methodologies;supervised learning;algorithm analysis and problem complexity
Analytical Solution for "EinStein wuerfelt nicht!" with One Stone.- Toward Solving EinStein wuerfelt nicht!.- Analysis of Fred Horn's Gloop Puzzle.- Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy Playing Hanabi Near-Optimally Optimal Play of the Farkle Dice GameDeep df-pn and its Efficient Implementations.- Improved Policy Networks for Computer Go.- Exploring Positional Linear Go.- Influence of Search Depth on Position Evaluation.- Evaluating Chess-like Games Using Generated Natural Language Descriptions.- Machine Learning in the Game of Breakthrough.- A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action among Similar States.- Exploration Bonuses Based on Upper Confidence Bounds for Sparse Developing a 2048 Player with Backward Temporal Coherence Learning and Restart.- A Little Bit of Frustration Can Go a Long Way.- Automated Adaptation and Assessment in Serious Games: A Portable Tool for Supporting Learning.- An Analysis of Majority Voting in Homogeneous Groups for Checkers: Understanding Group Performance through Unbalance.- Yasol: An Open Source Solver for Quantified Mixed Integer Programs.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
artificial intelligence;combinatorial game;complexity;distributed computing;evaluation function;game tree search;general game playing;heuristic function constructions;inductive logic programming;Markov decision progress;mchine learning;optimization;parallel search;planning and scheduling;random walk;realtime;reinforcement learning;search methodologies;supervised learning;algorithm analysis and problem complexity
