We have developed an algorithm that utilizes backtracking-based search to solve a 6x6 chess board. This algorithm is specifically designed to determine the satisfiability of propositional logic formulae in conjunctive normal form.
-
Notifications
You must be signed in to change notification settings - Fork 0
AlejandroVelascoG/ProyectoLCC
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Proyecto de Lógica para las ciencias de la computación, por David Moreno y Alejandro Velasco.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published