MiniZinc
1 program
Added 2025-10-27T13:37:11Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 156902ae75 · authored 2025-10-27T14:37:11+01:00 · model google/gemini-2.5-pro
Sources mentioning this language
6 sources · pl_id:
pl/minizincWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | constraint · logic |
|---|---|
| Typing | strong |
| Designed by | Monash University |
| First appeared | 2009 |
| Influenced by | Zinc |
| License | Mozilla Public License 2.0 |
| Implemented in | C++ |
| Homepage | https://www.minizinc.org/ |
Extensions claimed by this language
4 claims. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.dzn | wikidata | primary | 154.2K files |
.fzn | wikidata | primary | 13.5K files |
.mzn | linguist | primary | 62.0K files |
.mzn | wikidata | primary | 62.0K files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Australian Scrabble Problem
Provenance: commit 156902ae75 · authored 2025-10-27T14:37:11+01:00 · model google/gemini-2.5-pro · Temp 0.4
include "globals.mzn";
int: n_letters = 26;
set of int: LETTERS = 1..n_letters;
array[LETTERS] of int: scores =
[1, 3, 3, 2, 1, 4, 2, 4, 1, 8, 5, 1, 3, 1, 1, 3, 10, 1, 1, 1, 1, 4, 4, 8, 4, 10];
array[LETTERS] of int: counts =
[9, 2, 2, 4, 12, 2, 3, 2, 9, 1, 1, 4, 2, 6, 8, 2, 1, 6, 4, 6, 4, 2, 2, 1, 2, 1];
int: n_tiles = sum(counts);
array[1..n_tiles] of int: tiles =
[ l | l in LETTERS for i in 1..counts[l] ];
int: n_words;
set of int: WORDS = 1..n_words;
int: max_len;
set of int: POS = 1..max_len;
array[WORDS, POS] of int: word_letters;
array[WORDS] of int: word_len;
array[LETTERS] of var 0..9: letter_value;
var int: score;
constraint assert(sum(counts) == 98, "sum of counts is not 98");
constraint
alldifferent(letter_value) /\
letter_value[1] > 0;
constraint
score = sum(w in WORDS) (
sum(p in 1..word_len[w]) (
letter_value[word_letters[w,p]]
)
);
array[LETTERS] of var 0..max(counts): used;
constraint
forall(l in LETTERS) (
used[l] = sum(w in WORDS) (
count(word_letters[w,p] | p in 1..word_len[w], l)
)
);
constraint
forall(l in LETTERS) (
used[l] <= counts[l]
);
solve maximize score;
output ["The score is \(score)\n"] ++
["\(l) = \(fix(letter_value[l]));\n" | l in LETTERS];