Sciweavers

Share
6 search results - page 1 / 2
» icga 2008
Sort
View
ICGA
2008
123views Optimization» more  ICGA 2008»
8 years 2 months ago
A Survey of NP-Complete Puzzles
Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and into the a...
Graham Kendall, Andrew J. Parkes, Kristian Spoerer
ICGA
2008
113views Optimization» more  ICGA 2008»
8 years 2 months ago
Move Generation with Perfect Hash Functions
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
Trevor I. Fenner, Mark Levene
ICGA
2008
100views Optimization» more  ICGA 2008»
8 years 2 months ago
Learning the Piece Values for Three Chess Variants
A set of experiments for learning the values of chess pieces is described for the popular chess variants Crazyhouse Chess, Suicide Chess, and Atomic Chess. We follow an establishe...
Sacha Droste, Johannes Fürnkranz
ICGA
2008
208views Optimization» more  ICGA 2008»
8 years 2 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
MOBIHOC
2008
ACM
9 years 1 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
books