16 search results - page 2 / 4 » On Pruning Techniques for Multi-Player Games |
IJCAI
2007
13 years 6 months ago
2007
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
CP
2007
Springer
13 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
CG
2002
Springer
13 years 5 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
GAMEON
2001
13 years 6 months ago
2001
This paper investigates the application of neural network techniques to the creation of a program that can play the game of Go with some degree of success. The combination of soft...