Logic for fun : solving puzzles with SAT solvers
Over the years, SAT solvers have become more and more powerful; able to solve Boolean formulas with huge amounts of literals and clauses, and have seen more applications in recent technology. Decision puzzles, puzzles where one move affects subsequent moves, usually take a long time to solve using t...
Saved in:
Main Author: | Foo, Zhong Xian |
---|---|
Other Authors: | Alwen Fernanto Tiu |
Format: | Final Year Project |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/66900 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Statistical graph signal processing
by: Shi, Enbing
Published: (2023) -
Maximum distance separable symbol-pair codes
by: Chee, Yeow Meng, et al.
Published: (2013) -
Efficiently computing exact geodesic loops within finite steps
by: Xin, Shi-Qing, et al.
Published: (2013) -
On the algebraic structure of quasi-cyclic codes III : generator theory
by: Ling, San, et al.
Published: (2013) -
On the algebraic structure of quasi-cyclic codes II : chain rings
by: Ling, San, et al.
Published: (2013)