Sciweavers

140 search results - page 6 / 28
» A relation-algebraic approach to simple games
Sort
View
AI
2002
Springer
13 years 7 months ago
A hierarchical approach to computer Hex
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...
Vadim V. Anshelevich
JMLR
2011
106views more  JMLR 2011»
13 years 2 months ago
A Bayesian Approximation Method for Online Ranking
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
Ruby C. Weng, Chih-Jen Lin
GI
2009
Springer
13 years 5 months ago
Test your Strategy - Intuitive Strategy Definition and Evaluation for Novices and Experts
: ConnectIT uses a graphical representation to express strategies for playing the connect-four game. With this tool we can transfer complex knowledge about the connect-four game it...
Sven Jörges, Marco Bakera, Tiziana Margaria, ...
ER
2010
Springer
164views Database» more  ER 2010»
13 years 5 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
AIIDE
2008
13 years 10 months ago
Explicit Knowledge Programming for Computer Games
The main aim of this paper is to raise awareness of higherorder knowledge (knowledge about someone else's knowledge) as an issue for computer game AI. We argue that a number ...
Andreas Witzel, Jonathan A. Zvesper, Ethan Kennerl...