This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 1Artificial intelligence
- 1Automated Reasoning
- 1Computer games
- 1Conflict Directed Clause Learning (CDCL) SAT
- 1Decision Problem
- 1Decision/Branching Heuristic
-
Spring 2013
The game of Amazons is a young board game with simple rules, nice mathematical properties yet a high complexity between chess and Go. The state of the art Amazons solver was presented by Martin Müller in 2001 with which he solved the Amazons 5 × 5 starting position as a first player win. This...
-
Spring 2022
Boolean Satisfiability (SAT) is a well-known NP-complete problem. Despite the theoretical hardness of SAT, backtracking search based Conflict Directed ClauseLearning (CDCL) SAT solvers can solve very large real-world SAT instances with surprising efficiency. The high efficiency of CDCL SAT...