Skip to content

Commit fa0eb92

Browse files
committed
Update challenge 2025 descriptions
1 parent bb8b6a4 commit fa0eb92

File tree

4 files changed

+10
-6
lines changed

4 files changed

+10
-6
lines changed
Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,6 @@
1-
Atlantis is a constraint-based local search solver, designed and implemented by the Optimisation Group of Uppsala University. Atlantis takes inspiration from Localizer, Comet, OscaR.cbls, Yuck, and Kangaroo.
2-
The solver has mainly been developed by Frej Knutar Lewander (Department of Information Technology, Uppsala University), Gustav Björdal (Coupa Software), Pierre Flener (Department of Information Technology, Uppsala University), and Justin Pearson (Department of Information Technology, Uppsala University).
1+
Atlantis is a constraint-based local search solver, designed and implemented by the Optimisation Group of Uppsala University. Atlantis takes inspiration from Localizer, Comet, OscaR.cbls, Yuck, and Kangaroo.
2+
3+
The solver has mainly been developed by Frej Knutar Lewander (Department of Information Technology, Uppsala University), Gustav Björdal (Coupa Software), Pierre Flener (Department of Information Technology, Uppsala University), and Justin Pearson (Department
4+
of Information Technology, Uppsala University).
5+
6+
We thank Maarten Flippo, Max Perea Düring, Samuel Bodin, Viktor Bakken, Erik Braathen, and Jip Dekker for their contributions.

public/challenge/2025/description_fzn_picat_sat.txt renamed to public/challenge/2025/description_picatsat.txt

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ another.
2727

2828
For the sat module, the Picat compiler translates constraints into a
2929
logic formula in the conjunctive normal form (CNF) for the underlying
30-
SAT solver (the Maple solver is used for the competition). Picat
30+
SAT solver (the Kissat solver is used for the competition). Picat
3131
employs the so called log-encoding for compiling domain variables and
3232
constraints. For a domain with the maximum absolute value n,
3333
log_2(n) Boolean variables are used. If the domain contains both
@@ -46,4 +46,4 @@ Optimizing SAT Encodings for Arithmetic Constraints,
4646
CP 2017
4747

4848
We would like to thank Joachim Schimpf for sharing his FlatZinc parser
49-
with us and Sanders Hernandez for implementing the Maple interface.
49+
with us.

public/challenge/2025/results.js

Lines changed: 1 addition & 1 deletion
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

src/pages/challenge/2025/results.jsx

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ export default function ResultsPage() {
8282
</li>
8383
<li>
8484
<Link href="http://picat-lang.org">PicatSAT</Link> (
85-
<Link href="description_fzn_picat_sat.txt">description</Link>).
85+
<Link href="description_picatsat.txt">description</Link>).
8686
</li>
8787
<li>
8888
<Link href="https://github.com/ConSol-Lab/pumpkin">

0 commit comments

Comments
 (0)