Latest posts tagged with #PICAT on Bluesky
PICAT/ASVAB VERIFICATION TEST Questions and Answers. GRADED A+
#PICAT #ASVAB #picatasvab #asvab2026 #picatquestionsandanswers #picatquestionsandanswers #picat2026
www.stuvia.com/user/studypa...
www.stuvia.com/doc/3556245/...
PICAT ASVAB VERIFICATION TEST PRACTICE. LATEST UPDATED VERSION
#PICATASVAB #ASVAB #PICAT #picatverification #asvabverification
www.stuvia.com/doc/9224805/...
Here's the GitHub repo of the source code of the #Picat SAT FlatZinc solver fzn_picat_sat used in the MiniZinc Challenge 2025: github.com/hakank/fzn_p... .
For the result of the #MiniZinc Challenge 2025: www.minizinc.org/challenge/20... . (As mentioned earlier, the Picat SAT solver got two Silver.)
#Picat version 3.9 has been released: picat-lang.org
Updates: picat-lang.org/updates.txt
It contains improvements of the SAT solver and - which is really cool - a bit vector constraint module which makes it possible to use arbitrary sized domains (> 2**56) in constraint models.
1/3
1/ Let's start with a recent one: in #Prolog (and #Picat), almost all data besides primitives are unevaluated terms, meaning they can be matched on the components:
```
?- A = [(1 + 2 + 4), (3 + 4)], member(Y+X, A), Z is Y.
X = 4,
Y = 1+2,
Z = 3
```
Note Y is NOT 3, it's still the term `1+2`
Here's my (new) Litmus test of LLMs: The No change problem (from medium.com/puzzle-spher... )
#Picat program: www.hakank.org/picat/no_cha... showing two constraint approaches (and a brute force variant).
LLMs might get one of the two solutions, but often only after a lot of corrections.
#Picat version 3.8 is available: picat-lang.org/download.html
picat-lang.org/download.html
Updates: picat-lang.org/updates.txt
E.g. new if/then/else syntax variant, improved error handling, debug flag (-d) at command line, new between/4, and some other bug fixes.
#Picat version 3.8.b-4 is available: picat-lang.org/download.html
Updates: picat-lang.org/updates.txt (e.g. new if/then/else syntax variant, improved error handling, debug flag (-d) at command line, new between/4, and some other bug fixes).
#AdventOfCode (adventofcode.com) Day 25
#Picat: hakank.org/advent-of-co...
And thanks for all these wonderful (and - at least for me - sometimes too hard) puzzles!
#AdventOfCode Day 24: Here's two different approaches for solving Part 1 in #Picat using CP solver:
- hakank.org/advent-of-co...
- hakank.org/advent-of-co...
part1b.pi was the one I used to get a point since part1.pi contained an annoying bug (fixed via DestyNova's hint).
Probably the last variant for today: #Picat with input parsing using DCG (Definite Clause Grammar): hakank.org/advent-of-co...
Here's a #Picat version using my regex library to parse the input file: hakank.org/advent-of-co... (and combined that with list comprehension). About the same time as the original Picat program.
#Picat: hakank.org/advent-of-co... (part 1 and part 2)
Brute force for part 1: hakank.org/advent-of-co...
#Picat solution: www.hakank.org/advent-of-co...
The #Picat program: hakank.org/advent-of-co...
in #Picat
part1 =>
[A,B] = [Line.map(to_int): Line in read_file_lines("1.txt").map(split)].transpose.map(sort),
[abs(A[I]-B[I]) : I in 1..A.len].sum.println.
