Solving parity games by a reduction to SAT.
Keijo HeljankoMisa KeinänenMartin LangeIlkka NiemeläPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- stochastic local search
- satisfiability problem
- sat instances
- error correction
- variable ordering
- game theoretic
- video games
- sat encodings
- sat solving
- search strategies
- game play
- np complete problems
- solving hard
- boolean optimization
- search algorithm
- game theory
- solving problems
- game design
- graph coloring
- nash equilibria
- sat solvers
- computer games
- combinatorial optimization
- constraint satisfaction problems
- simulated annealing