Proof trees for weak achievement games

MaRDI QIDQ3629029zbMATH OpenFDO

Authors Nándor Sieben

Publication date 26 May 2009

Full work available at URL https://eudml.org/doc/117414, http://www.emis.de/journals/INTEGERS/papers/ig7/ig7.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Polyominoes (05B50) Combinatorial games (91A46)

Recommendations

• Proof-number search
• An effective two-level proof-number search algorithm
• Weak Proof-Number Search
• Multiple-outcome proof number search
• Proof-Number Search and Its Variants

Cited in

(2)

• On solving the 7,7,5-game and the 8,8,5-game
• scientific article; zbMATH DE number 988841 (Why is no real title available?)

This page was built for publication: Proof trees for weak achievement games

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