scientific article; zbMATH DE number 1944394

zbMATH Open1046.91024MaRDI QIDQ4407697FDOQ4407697

Authors: David Wolfe 

Publication date: 2002

Full work available at URL: http://www.msri.org/communications/books/Book42/

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 988835
• PSPACE-Hardness of some combinatorial games
• scientific article; zbMATH DE number 1759687
• Phutball is PSPACE-hard
• The Othello game on an \(n\times n\) board is PSPACE-complete

zbMATH Keywords

combinatorial game theorygame tree

Mathematics Subject Classification ID

Combinatorial games (91A46)

Cited In (9)

• Playing Savitch and cooking games
• Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
• Phutball is PSPACE-hard
• Complexity, appeal and challenges of combinatorial games
• Combinatorial pawn power.
• An algorithmic analysis of the Honey-Bee game
• PSPACE-Hardness of some combinatorial games
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407697)