prolog-checkers
clpz
Our great sponsors
| prolog-checkers | clpz | |
|---|---|---|
| 1 | 5 | |
| 10 | 172 | |
| - | - | |
| 1.8 | 4.4 | |
| about 3 years ago | 3 months ago | |
| Prolog | Prolog | |
| MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
prolog-checkers
-
Prolog Chess AI, Alpha Beta Pruning
For my AI, I am mainly looking at the book "Prolog programming for artificial intelligence" by Ivan Bratko(3rd Edition). There he shows an implementation of the alpha-beta algorithm. I am also looking at the Prolog-Code someone posted on Github, where he implemented the same Code fpr his Checkersgame. (https://github.com/migafgarcia/prolog-checkers/blob/master/checkers.pl)
clpz
-
Logic programming is overrated, at least for logic puzzles (2013)
As pointed out in the comments in the article, these kinds of logic puzzles are easier to solve using constraint programming than "regular" logic programming.
For example, see the solution to the Zebra Puzzle here: https://www.metalevel.at/prolog/puzzles which uses CLPZ[^1].
[^1]: https://github.com/triska/clpz
-
Markus Triska Interview on Prolog
Scryer has the strings-as-lists-but-implemented-efficiently thing, possibly more strict ISO Prolog compatible syntax, and it may ship with a more advanced constraint library (I'm not clear on the relationship between SWI's clpfd and Scryer clpz).
-
is it possible to have a reversable operation
None of these are full-fledged programming languages, however. They're limited to problems that lie in the polynomial hierarchy (A class which contains P and NP). Logic programming is generally only used to solve hard problems for which no good algorithm is known. Prolog also sort of fits this niche and it has a bunch of solvers integrated into it. Notably CLPFD which uses https://github.com/triska/clpz for constraint logic programming. Rosette (https://docs.racket-lang.org/rosette-guide/index.html) is another solver-based language. Except it uses lisp syntax (it's embedded in the Racket language). It uses Z3 as a solver (linked above for SMT theories)
- Ask HN: Do you use an optimization solver? Which one? Why? Do you like it?
-
What is the difference between constraint solving and constraints programming?
Constraint programming I guess is when one uses a prolog library such as: https://github.com/triska/clpz
What are some alternatives?
logtalk3 - Logtalk - declarative object-oriented logic programming language
HiGHS - Linear optimization software
SSI - A Prolog Compiler written in Prolog.
sparqlprog - logic programming with SPARQL
kanren - An extensible, lightweight relational/logic programming DSL written in pure Python
Sanmill - Sanmill is an open-source, UCI-like Mill/Morris/Merrills/Mühle/Malom (and its variants) program with CUI, Flutter GUI and Qt GUI, sharing and freely distributing the code, tools and data needed to deliver this mill game. We do this because we are convinced that open software and open data are key ingredients to make rapid progress.
or-tools - Google's Operations Research tools:
nbsdgames - A package of 18 text-based modern games
csips - A pure-python integer programming solver
terminusdb - TerminusDB is a distributed database with a collaboration model
optaplanner-quickstarts - Mirror of https://github.com/apache/incubator-kie-optaplanner-quickstarts