3 search results - page 1 / 1 » Phutball Endgames are Hard |
55
Voted
CORR
2000
Springer
14 years 10 months ago
2000
Springer
We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins...
ICML
2003
IEEE
15 years 11 months ago
2003
IEEE
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
CG
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...