An experiment that uses sat-js with Phaser.
-
Updated
May 6, 2016 - JavaScript
An experiment that uses sat-js with Phaser.
The CNF-SAT problem is: Given a logical expression in Conjunctive Normal Form, is there a truth assignment for the variables which causes the CNF expression to be true? Answer is yes, if there is an assignment that makes all the clauses evaluate to T (true). Use a depth first search algorithm for solving the problem. After you assign values to a…
The CNF-SAT problem is: Given a logical expression in Conjunctive Normal Form, is there a truth assignment for the variables which causes the CNF expression to be true? Answer is yes, if there is an assignment that makes all the clauses evaluate to T (true).
Virtual Machine Consolidation in Haskell
Projeto realizado para matéria de Métodos Formais - O programa deve receber um arquivo de entrada que represente a situação inicial de um jogo de sudoku e, à partir dele, gerar uma fórmula lógica para servir de entrada ao programa "zchaff", resolvedor SAT
WIP: Wrapper para facturas CFDI del Servicio de Administración Tributaria
Esquemas, Documentos y Catalogos para el CFDI del SAT
A simple JS module for checking for collisions between two shapes
SAT-based Sudoku solver, written in Python.
Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC). Secondly, by converting to Satisfiability Problem (SAT) and using a sat solver (miniSAT).
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
Add a description, image, and links to the sat topic page so that developers can more easily learn about it.
To associate your repository with the sat topic, visit your repo's landing page and select "manage topics."