Quantified Boolean Solving for Achievement Games

DOI10.1007/978-3-030-87626-5_3MaRDI QIDQ6488139zbMATH OpenFDO

Authors Roger Villemaire

Publication date 29 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-87626-5_3

Mathematics Subject Classification ID

2-person games (91A05)

Recommendations

• \(2^{3}\) quantified Boolean formula games and their complexities
• Symbolic computational techniques for solving games
• Theory and Applications of Satisfiability Testing
• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• A non-prenex, non-clausal QBF solver with game-state learning

Cites work

• Achieving snaky
• Blocked clause elimination for QBF
• CAQE and QuAbS: Abstraction Based QBF Solvers
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Gobang is PSPACE-complete
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• scientific article; zbMATH DE number 994580 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 874073 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• On the complexity of chooser-picker positional games
• Playing games with algorithms: algorithmic combinatorial game theory
• Positional games and QBF: the corrective encoding
• QRATPre+: effective QBF preprocessing via strong redundancy properties

Cited in

(1)

• \(2^{3}\) quantified Boolean formula games and their complexities

This page was built for publication: Quantified Boolean Solving for Achievement Games

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