UWrMaxSat: Efficient Solver for MaxSAT and Pseudo-Boolean Problems

Author(s):  
Marek Piotrow
Keyword(s):  
Author(s):  
Todd W. Neller ◽  
Connor Berson ◽  
Jivan Kharel ◽  
Ryan Smolik

In this article, we describe the lessons learned in creating an efficient solver for the solitaire game Birds of a Feather. We introduce a new variant of depth-first search that we call best-n depth-first search that achieved a 99.56% reduction in search time over 100,000 puzzle seeds. We evaluate a number of potential node-ordering search features and pruning tests, perform an analysis of solvability prediction with such search features, and consider possible future research directions suggested by the most computationally expensive puzzle seeds encountered in our testing.


PAMM ◽  
2013 ◽  
Vol 13 (1) ◽  
pp. 441-442
Author(s):  
Florica Ioana Dragomirescu ◽  
Romeo Susan-Resiga ◽  
Sebastian Muntean

2019 ◽  
Vol 89 (323) ◽  
pp. 1193-1227 ◽  
Author(s):  
Monica Montardini ◽  
Matteo Negri ◽  
Giancarlo Sangalli ◽  
Mattia Tani

2020 ◽  
Vol 80 (11) ◽  
pp. 2586-2603
Author(s):  
Gabriele Loli ◽  
Monica Montardini ◽  
Giancarlo Sangalli ◽  
Mattia Tani

2001 ◽  
Vol 43 (2) ◽  
pp. 105-129 ◽  
Author(s):  
M. Brocchini ◽  
R. Bernetti ◽  
A. Mancinelli ◽  
G. Albertini
Keyword(s):  

2017 ◽  
Vol 36 (4) ◽  
pp. 1 ◽  
Author(s):  
Zherong Pan ◽  
Dinesh Manocha
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document