Sciweavers

28 search results - page 5 / 6
» Using heuristics to evaluate the playability of games
Sort
View
AI
2006
Springer
13 years 7 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
AICT
2006
IEEE
162views Communications» more  AICT 2006»
14 years 1 months ago
A Bayesian framework for online reputation systems
— As the number of online auction sites has increased, interest towards providing reliable summaries, reputations, about the past behaviour of sellers has risen. Existing approac...
Petteri Nurmi
IJCAI
2007
13 years 9 months ago
Coalitional Bargaining with Agent Type Uncertainty
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
Georgios Chalkiadakis, Craig Boutilier
ACG
2009
Springer
14 years 2 months ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 8 months ago
Fitnessless coevolution
We introduce fitnessless coevolution (FC), a novel method of comparative one-population coevolution. FC plays games between individuals to settle tournaments in the selection pha...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...