#minizinc — Public Fediverse posts

We have another confirmed talk for the #FPIndia #Bangalore #meetup tomorrow! Ishaan will talk about Discrete optimisation and #MiniZinc! hasgeek.com/fpindia/bang... #Haskell #PureScript #Erlang #Scala #OCaml #Rust #Clojure

Bangalore FP May 2026 meetup

We have another confirmed talk for the #FPIndia #Bangalore #meetup tomorrow! Ishaan will talk about Discrete optimisation and #MiniZinc! hasgeek.com/fpindia/bang... #Haskell #PureScript #Erlang #Scala #OCaml #Rust #Clojure

Bangalore FP May 2026 meetup

We have another confirmed talk for the #FPIndia #Bangalore #meetup tomorrow! Ishaan will talk about Discrete optimisation and #MiniZinc! hasgeek.com/fpindia/bang... #Haskell #PureScript #Erlang #Scala #OCaml #Rust #Clojure

Bangalore FP May 2026 meetup

We have another confirmed talk for the #FPIndia #Bangalore #meetup tomorrow! Ishaan will talk about Discrete optimisation and #MiniZinc! hasgeek.com/fpindia/bang... #Haskell #PureScript #Erlang #Scala #OCaml #Rust #Clojure

Bangalore FP May 2026 meetup

Ich habe ausprobiert, wie man eine typische Knobelaufgabe mit logischer Programmierung lösen kann: https://sebstein.hpfsc.de/2025/12/31/logische-programmierung/

#MiniZinc

Ich habe ausprobiert, wie man eine typische Knobelaufgabe mit logischer Programmierung lösen kann: https://sebstein.hpfsc.de/2025/12/31/logische-programmierung/

#MiniZinc

Ich habe ausprobiert, wie man eine typische Knobelaufgabe mit logischer Programmierung lösen kann: https://sebstein.hpfsc.de/2025/12/31/logische-programmierung/

#MiniZinc

Ich habe ausprobiert, wie man eine typische Knobelaufgabe mit logischer Programmierung lösen kann: https://sebstein.hpfsc.de/2025/12/31/logische-programmierung/

#MiniZinc

[Перевод] Решение головоломки NYTimes Pips с помощью решателя ограничений

Кажется, что головоломка NYT Pips — это просто игра с домино и цветными клетками. Но если взглянуть на неё как на задачу удовлетворения ограничений, она превращается в удобный полигон для современных решателей вроде MiniZinc. В статье автор показывает, как описать Pips не в виде алгоритма перебора, а в виде системы ограничений: сетка, домино, суммы по областям, симметрии и «мусорные» решения. По ходу дела выясняется, что войти в мир constraint solving можно буквально за пару часов, а заодно на практике понять, почему эти инструменты умеют разруливать экспоненциальный хаос вариантов за миллисекунды — но иногда внезапно «залипают» на одной и той же головоломке. Читать разбор

https://habr.com/ru/companies/otus/articles/975004/

#решатели_ограничений #MiniZinc #моделирование_ограничений #поиск_решений #бэктрекинг #оптимизация_перебора #головоломки #алгоритмическое_моделирование

[Перевод] Решение головоломки NYTimes Pips с помощью решателя ограничений

Кажется, что головоломка NYT Pips — это просто игра с домино и цветными клетками. Но если взглянуть на неё как на задачу удовлетворения ограничений, она превращается в удобный полигон для современных решателей вроде MiniZinc. В статье автор показывает, как описать Pips не в виде алгоритма перебора, а в виде системы ограничений: сетка, домино, суммы по областям, симметрии и «мусорные» решения. По ходу дела выясняется, что войти в мир constraint solving можно буквально за пару часов, а заодно на практике понять, почему эти инструменты умеют разруливать экспоненциальный хаос вариантов за миллисекунды — но иногда внезапно «залипают» на одной и той же головоломке. Читать разбор

https://habr.com/ru/companies/otus/articles/975004/

#решатели_ограничений #MiniZinc #моделирование_ограничений #поиск_решений #бэктрекинг #оптимизация_перебора #головоломки #алгоритмическое_моделирование

[Перевод] Многие сложные задачи на LeetCode — это простые задачи на ограничения

Иногда впечатление от алгоритмических задач такое, будто вас просят не решать проблему, а угадать «правильный» трюк из головы автора. В этой статье мы посмотрим на те же самые leetcode-подобные задачи глазами человека, который устал изобретать стеки и динамику на собеседовании и попробовал формулировать их как задачу оптимизации для солвера ограничений. Разбираем, как привычные «найди максимум при таких-то условиях» превращаются в компактные декларативные модели, зачем вообще нужны такие упражнения, что они говорят о собеседованиях и о нашем отношении к алгоритмам — и где у подхода с MiniZinc/constraint solving проходят естественные границы. Смотреть подход

https://habr.com/ru/companies/otus/articles/970468/

#задачи #leetcode #алгоритмы #задачи_на_ограничения #временная_сложность #MiniZinc #солвер_ограничений #оптимизация_задач #собеседование_разработчика #алгоритмические_задачи

[Перевод] Многие сложные задачи на LeetCode — это простые задачи на ограничения

Иногда впечатление от алгоритмических задач такое, будто вас просят не решать проблему, а угадать «правильный» трюк из головы автора. В этой статье мы посмотрим на те же самые leetcode-подобные задачи глазами человека, который устал изобретать стеки и динамику на собеседовании и попробовал формулировать их как задачу оптимизации для солвера ограничений. Разбираем, как привычные «найди максимум при таких-то условиях» превращаются в компактные декларативные модели, зачем вообще нужны такие упражнения, что они говорят о собеседованиях и о нашем отношении к алгоритмам — и где у подхода с MiniZinc/constraint solving проходят естественные границы. Смотреть подход

https://habr.com/ru/companies/otus/articles/970468/

#задачи #leetcode #алгоритмы #задачи_на_ограничения #временная_сложность #MiniZinc #солвер_ограничений #оптимизация_задач #собеседование_разработчика #алгоритмические_задачи

Hai tất cả! Một bài đăng mới trên Reddit giới thiệu cách ứng dụng quy hoạch lịch làm việc theo bờ tròn trong MiniZinc. Nó giúp tối ưu hóa phân bổ nhân lực với cách phối hợp thời gian làm việc dài hạn. Tham gia язык vào cuộc thảo luận về nghiệm pháp coast this cam kết mã nguồn mở! #MiniZinc #QuyHóaLịchLàmViệc #MãNguồnMở #LậpTrình #Technology #TechTalk #Programming #OpenSource

https://www.reddit.com/r/programming/comments/1ol30lv/rotating_workforce_scheduling_in_minizinc/

Hai tất cả! Một bài đăng mới trên Reddit giới thiệu cách ứng dụng quy hoạch lịch làm việc theo bờ tròn trong MiniZinc. Nó giúp tối ưu hóa phân bổ nhân lực với cách phối hợp thời gian làm việc dài hạn. Tham gia язык vào cuộc thảo luận về nghiệm pháp coast this cam kết mã nguồn mở! #MiniZinc #QuyHóaLịchLàmViệc #MãNguồnMở #LậpTrình #Technology #TechTalk #Programming #OpenSource

https://www.reddit.com/r/programming/comments/1ol30lv/rotating_workforce_scheduling_in_minizinc/

🚀 Wow, what a thrill! An article about squeezing workforce schedules into #MiniZinc. Because nothing screams excitement like cactus plots and footnotes on night shifts! 🌵🌙
https://zayenz.se/blog/post/rotating-workforce-scheduling/ #CactusPlots #WorkforceScheduling #NightShifts #ExcitingData #HackerNews #ngated

🚀 Wow, what a thrill! An article about squeezing workforce schedules into #MiniZinc. Because nothing screams excitement like cactus plots and footnotes on night shifts! 🌵🌙
https://zayenz.se/blog/post/rotating-workforce-scheduling/ #CactusPlots #WorkforceScheduling #NightShifts #ExcitingData #HackerNews #ngated

🚀 Wow, what a thrill! An article about squeezing workforce schedules into #MiniZinc. Because nothing screams excitement like cactus plots and footnotes on night shifts! 🌵🌙
https://zayenz.se/blog/post/rotating-workforce-scheduling/ #CactusPlots #WorkforceScheduling #NightShifts #ExcitingData #HackerNews #ngated

🚀 Wow, what a thrill! An article about squeezing workforce schedules into #MiniZinc. Because nothing screams excitement like cactus plots and footnotes on night shifts! 🌵🌙
https://zayenz.se/blog/post/rotating-workforce-scheduling/ #CactusPlots #WorkforceScheduling #NightShifts #ExcitingData #HackerNews #ngated

Rotating Workforce Scheduling in MiniZinc

https://zayenz.se/blog/post/rotating-workforce-scheduling/

#HackerNews #RotatingWorkforce #Scheduling #MiniZinc #Optimization #Algorithms #WorkforceManagement

Rotating Workforce Scheduling in MiniZinc

https://zayenz.se/blog/post/rotating-workforce-scheduling/

#HackerNews #RotatingWorkforce #Scheduling #MiniZinc #Optimization #Algorithms #WorkforceManagement

Rotating Workforce Scheduling in MiniZinc

https://zayenz.se/blog/post/rotating-workforce-scheduling/

#HackerNews #RotatingWorkforce #Scheduling #MiniZinc #Optimization #Algorithms #WorkforceManagement

Rotating Workforce Scheduling in MiniZinc

https://zayenz.se/blog/post/rotating-workforce-scheduling/

#HackerNews #RotatingWorkforce #Scheduling #MiniZinc #Optimization #Algorithms #WorkforceManagement

Начал изучать солверы
после какой-то статьи с лобсте.рс, с месседжем "солверы могут решать значительную часть сложного литкода (хоть и не максимально быстро и без прогнозов скорости), и решение легко адаптируется к изменению требований"

Не вижу, где это можно применить мне; теоретически, можно попробовать сделать декларативный язык программирования для создания музыки (где ты накладываешь на мелодию ограничения, выбираешь сид и тебе генерируется мелодия)... Ещё всё лелею идею на работе сделать планировщик, который бы работал на солвере, но это так (я не хочу тут где работаю сейчас работать программистом а не QA)

https://buttondown.com/hillelwayne/archive/many-hard-leetcode-problems-are-easy-constraint/

#Solvers #MiniZinc #Солверы #Миницинк #SAT #САТ #лытдыбр

Начал изучать солверы
после какой-то статьи с лобсте.рс, с месседжем "солверы могут решать значительную часть сложного литкода (хоть и не максимально быстро и без прогнозов скорости), и решение легко адаптируется к изменению требований"

Не вижу, где это можно применить мне; теоретически, можно попробовать сделать декларативный язык программирования для создания музыки (где ты накладываешь на мелодию ограничения, выбираешь сид и тебе генерируется мелодия)... Ещё всё лелею идею на работе сделать планировщик, который бы работал на солвере, но это так (я не хочу тут где работаю сейчас работать программистом а не QA)

https://buttondown.com/hillelwayne/archive/many-hard-leetcode-problems-are-easy-constraint/

#Solvers #MiniZinc #Солверы #Миницинк #SAT #САТ #лытдыбр

@joshg Took a few minutes to type in, but it’s not egregious, the logic is straightforward and can be solved by hand easily. But it’s more instructive this way:

include "alldifferent.mzn";

% Two lists of ints between 1 and 5, both inclusive
% One we'll use for the indices of the matrix cell coordinates, and the other for cell values.
set of int: COORD = 1..5;
set of int: VALUE = 1..5;

% Define a matrix, which is a 2-dimensional array with indices for its cells
% defined by COORD, so between 1 and 5, where each matrix cell
% takes any value of those defined in the list VALUE:
array[COORD,COORD] of var VALUE: v;

% All different in rows: the 'j' coordinate advances in the column
constraint forall(i,j in v)(
alldifferent([v[i,j] | j in VALUE]));

% All different in columns: the 'i' coordinate advances in the row
constraint forall(i,j in v)(
alldifferent([v[i,j] | i in VALUE]));

% All the groups of cells that add up to 10,
% using either sums (+ sign) or multiplications (* sign)
constraint v[1,1] + v[1,2] + v[1,3] + v[1,4] = 10;
constraint v[1,5] + v[2,5] + v[3,5] = 10;
constraint v[2,1] + v[2,2] + v[3,1] = 10;
constraint v[2,3] * v[2,4] * v[3,4] = 10;
constraint v[3,2] + v[3,3] + v[4,2] = 10;
constraint v[4,1] + v[5,1] + v[5,2] = 10;
constraint v[4,3] + v[5,3] + v[5,4] + v[5,5] = 10;
constraint v[4,4] * v[4,5] = 10;

solve satisfy;

#CSP #minizinc

@joshg Took a few minutes to type in, but it’s not egregious, the logic is straightforward and can be solved by hand easily. But it’s more instructive this way:

include "alldifferent.mzn";

% Two lists of ints between 1 and 5, both inclusive
% One we'll use for the indices of the matrix cell coordinates, and the other for cell values.
set of int: COORD = 1..5;
set of int: VALUE = 1..5;

% Define a matrix, which is a 2-dimensional array with indices for its cells
% defined by COORD, so between 1 and 5, where each matrix cell
% takes any value of those defined in the list VALUE:
array[COORD,COORD] of var VALUE: v;

% All different in rows: the 'j' coordinate advances in the column
constraint forall(i,j in v)(
alldifferent([v[i,j] | j in VALUE]));

% All different in columns: the 'i' coordinate advances in the row
constraint forall(i,j in v)(
alldifferent([v[i,j] | i in VALUE]));

% All the groups of cells that add up to 10,
% using either sums (+ sign) or multiplications (* sign)
constraint v[1,1] + v[1,2] + v[1,3] + v[1,4] = 10;
constraint v[1,5] + v[2,5] + v[3,5] = 10;
constraint v[2,1] + v[2,2] + v[3,1] = 10;
constraint v[2,3] * v[2,4] * v[3,4] = 10;
constraint v[3,2] + v[3,3] + v[4,2] = 10;
constraint v[4,1] + v[5,1] + v[5,2] = 10;
constraint v[4,3] + v[5,3] + v[5,4] + v[5,5] = 10;
constraint v[4,4] * v[4,5] = 10;

solve satisfy;

#CSP #minizinc

@joshg Took a few minutes to type in, but it’s not egregious, the logic is straightforward and can be solved by hand easily. But it’s more instructive this way:

include "alldifferent.mzn";

% Two lists of ints between 1 and 5, both inclusive
% One we'll use for the indices of the matrix cell coordinates, and the other for cell values.
set of int: COORD = 1..5;
set of int: VALUE = 1..5;

% Define a matrix, which is a 2-dimensional array with indices for its cells
% defined by COORD, so between 1 and 5, where each matrix cell
% takes any value of those defined in the list VALUE:
array[COORD,COORD] of var VALUE: v;

% All different in rows: the 'j' coordinate advances in the column
constraint forall(i,j in v)(
alldifferent([v[i,j] | j in VALUE]));

% All different in columns: the 'i' coordinate advances in the row
constraint forall(i,j in v)(
alldifferent([v[i,j] | i in VALUE]));

% All the groups of cells that add up to 10,
% using either sums (+ sign) or multiplications (* sign)
constraint v[1,1] + v[1,2] + v[1,3] + v[1,4] = 10;
constraint v[1,5] + v[2,5] + v[3,5] = 10;
constraint v[2,1] + v[2,2] + v[3,1] = 10;
constraint v[2,3] * v[2,4] * v[3,4] = 10;
constraint v[3,2] + v[3,3] + v[4,2] = 10;
constraint v[4,1] + v[5,1] + v[5,2] = 10;
constraint v[4,3] + v[5,3] + v[5,4] + v[5,5] = 10;
constraint v[4,4] * v[4,5] = 10;

solve satisfy;

#CSP #minizinc

@joshg Took a few minutes to type in, but it’s not egregious, the logic is straightforward and can be solved by hand easily. But it’s more instructive this way:

include "alldifferent.mzn";

% Two lists of ints between 1 and 5, both inclusive
% One we'll use for the indices of the matrix cell coordinates, and the other for cell values.
set of int: COORD = 1..5;
set of int: VALUE = 1..5;

% Define a matrix, which is a 2-dimensional array with indices for its cells
% defined by COORD, so between 1 and 5, where each matrix cell
% takes any value of those defined in the list VALUE:
array[COORD,COORD] of var VALUE: v;

% All different in rows: the 'j' coordinate advances in the column
constraint forall(i,j in v)(
alldifferent([v[i,j] | j in VALUE]));

% All different in columns: the 'i' coordinate advances in the row
constraint forall(i,j in v)(
alldifferent([v[i,j] | i in VALUE]));

% All the groups of cells that add up to 10,
% using either sums (+ sign) or multiplications (* sign)
constraint v[1,1] + v[1,2] + v[1,3] + v[1,4] = 10;
constraint v[1,5] + v[2,5] + v[3,5] = 10;
constraint v[2,1] + v[2,2] + v[3,1] = 10;
constraint v[2,3] * v[2,4] * v[3,4] = 10;
constraint v[3,2] + v[3,3] + v[4,2] = 10;
constraint v[4,1] + v[5,1] + v[5,2] = 10;
constraint v[4,3] + v[5,3] + v[5,4] + v[5,5] = 10;
constraint v[4,4] * v[4,5] = 10;

solve satisfy;

#CSP #minizinc

Because of our Eureka Prize nomination, the MiniZinc team was interviewed by the ARDC. Learn about some MiniZinc projects, and our perspective on MiniZinc and its development: https://ardc.edu.au/article/shaping-research-software-an-interview-with-the-minizinc-team/

#MiniZinc #Development #SoftwareEngineering #ConstraintModelling #ORMS #Optimization

Because of our Eureka Prize nomination, the MiniZinc team was interviewed by the ARDC. Learn about some MiniZinc projects, and our perspective on MiniZinc and its development: https://ardc.edu.au/article/shaping-research-software-an-interview-with-the-minizinc-team/

#MiniZinc #Development #SoftwareEngineering #ConstraintModelling #ORMS #Optimization

Because of our Eureka Prize nomination, the MiniZinc team was interviewed by the ARDC. Learn about some MiniZinc projects, and our perspective on MiniZinc and its development: https://ardc.edu.au/article/shaping-research-software-an-interview-with-the-minizinc-team/

#MiniZinc #Development #SoftwareEngineering #ConstraintModelling #ORMS #Optimization

Because of our Eureka Prize nomination, the MiniZinc team was interviewed by the ARDC. Learn about some MiniZinc projects, and our perspective on MiniZinc and its development: https://ardc.edu.au/article/shaping-research-software-an-interview-with-the-minizinc-team/

#MiniZinc #Development #SoftwareEngineering #ConstraintModelling #ORMS #Optimization

📣 MiniZinc 2.8.6 is here! 🎉

This release includes various bug fixes and improvements. See the full changelog here: https://docs.minizinc.dev/en/2.8.6/changelog.html#version-2-8-6

Upgrade now and start modelling! 🚀

#MiniZinc #ConstraintModelling #Optimization #ORMS

📣 MiniZinc 2.8.6 is here! 🎉

This release includes various bug fixes and improvements. See the full changelog here: https://docs.minizinc.dev/en/2.8.6/changelog.html#version-2-8-6

Upgrade now and start modelling! 🚀

#MiniZinc #ConstraintModelling #Optimization #ORMS

📣 MiniZinc 2.8.6 is here! 🎉

This release includes various bug fixes and improvements. See the full changelog here: https://docs.minizinc.dev/en/2.8.6/changelog.html#version-2-8-6

Upgrade now and start modelling! 🚀

#MiniZinc #ConstraintModelling #Optimization #ORMS

📣 MiniZinc 2.8.6 is here! 🎉

This release includes various bug fixes and improvements. See the full changelog here: https://docs.minizinc.dev/en/2.8.6/changelog.html#version-2-8-6

Upgrade now and start modelling! 🚀

#MiniZinc #ConstraintModelling #Optimization #ORMS

The full MiniZinc challenge results are now available on the website: https://www.minizinc.org/challenge/2024/results/

Thank you to all the dedicated solver creators that competed in the competition!

#MiniZinc #ConstraintModelling #Optimization

The full MiniZinc challenge results are now available on the website: https://www.minizinc.org/challenge/2024/results/

Thank you to all the dedicated solver creators that competed in the competition!

#MiniZinc #ConstraintModelling #Optimization

The full MiniZinc challenge results are now available on the website: https://www.minizinc.org/challenge/2024/results/

Thank you to all the dedicated solver creators that competed in the competition!

#MiniZinc #ConstraintModelling #Optimization

The full MiniZinc challenge results are now available on the website: https://www.minizinc.org/challenge/2024/results/

Thank you to all the dedicated solver creators that competed in the competition!

#MiniZinc #ConstraintModelling #Optimization

The MiniZinc Challenge results will be announced soon! 🥳

#MiniZinc https://mastodon.acm.org/@cp_conf/113083601921201917

The MiniZinc Challenge results will be announced soon! 🥳

#MiniZinc https://mastodon.acm.org/@cp_conf/113083601921201917

The MiniZinc Challenge results will be announced soon! 🥳

#MiniZinc https://mastodon.acm.org/@cp_conf/113083601921201917

The MiniZinc Challenge results will be announced soon! 🥳

#MiniZinc https://mastodon.acm.org/@cp_conf/113083601921201917

I’m excited to share that the core MiniZinc team is one of the finalists for the 2024 Eureka Prize for Excellence in Research Software. It’s an honour to be shortlisted for such a prestigious award.

https://youtu.be/a4IMa5MjAGo?si=52NzR4-LLylPuakq

#MiniZinc #ConstraintModelling #EurekaPrizes

I’m excited to share that the core MiniZinc team is one of the finalists for the 2024 Eureka Prize for Excellence in Research Software. It’s an honour to be shortlisted for such a prestigious award.

https://youtu.be/a4IMa5MjAGo?si=52NzR4-LLylPuakq

#MiniZinc #ConstraintModelling #EurekaPrizes

I’m excited to share that the core MiniZinc team is one of the finalists for the 2024 Eureka Prize for Excellence in Research Software. It’s an honour to be shortlisted for such a prestigious award.

https://youtu.be/a4IMa5MjAGo?si=52NzR4-LLylPuakq

#MiniZinc #ConstraintModelling #EurekaPrizes

I’m excited to share that the core MiniZinc team is one of the finalists for the 2024 Eureka Prize for Excellence in Research Software. It’s an honour to be shortlisted for such a prestigious award.

https://youtu.be/a4IMa5MjAGo?si=52NzR4-LLylPuakq

#MiniZinc #ConstraintModelling #EurekaPrizes

Congrats to the finalists for the Eureka Prize for Excellence in Research Software, developing and maintaining #MiniZinc, MRtrix3 and #limma

This prize recognises and celebrates those who develop and maintain software in Australia that underpins research and scientific discovery.
https://ardc.edu.au/article/finalists-announced-for-the-2024-ardc-eureka-prize-for-excellence-in-research-software/

Congrats to the finalists for the Eureka Prize for Excellence in Research Software, developing and maintaining #MiniZinc, MRtrix3 and #limma

This prize recognises and celebrates those who develop and maintain software in Australia that underpins research and scientific discovery.
https://ardc.edu.au/article/finalists-announced-for-the-2024-ardc-eureka-prize-for-excellence-in-research-software/

Congrats to the finalists for the Eureka Prize for Excellence in Research Software, developing and maintaining #MiniZinc, MRtrix3 and #limma

This prize recognises and celebrates those who develop and maintain software in Australia that underpins research and scientific discovery.
https://ardc.edu.au/article/finalists-announced-for-the-2024-ardc-eureka-prize-for-excellence-in-research-software/

Has anyone noticed yet that the MiniZinc documentation has moved to @readthedocs ?

It is now easier than ever to navigate between different versions of the documentation. https://docs.minizinc.dev/

#MiniZinc #documentation

Has anyone noticed yet that the MiniZinc documentation has moved to @readthedocs ?

It is now easier than ever to navigate between different versions of the documentation. https://docs.minizinc.dev/

#MiniZinc #documentation

Has anyone noticed yet that the MiniZinc documentation has moved to @readthedocs ?

It is now easier than ever to navigate between different versions of the documentation. https://docs.minizinc.dev/

#MiniZinc #documentation

Has anyone noticed yet that the MiniZinc documentation has moved to @readthedocs ?

It is now easier than ever to navigate between different versions of the documentation. https://docs.minizinc.dev/

#MiniZinc #documentation

I really like the small optimizations I merged into MiniZinc. When you use the `in` or inequality operators on records or tuples, then the compiler will automatically try and create `table` or `lex_less(eq)` constraints. 🙌

#MiniZinc #SmallWins

I really like the small optimizations I merged into MiniZinc. When you use the `in` or inequality operators on records or tuples, then the compiler will automatically try and create `table` or `lex_less(eq)` constraints. 🙌

#MiniZinc #SmallWins

I really like the small optimizations I merged into MiniZinc. When you use the `in` or inequality operators on records or tuples, then the compiler will automatically try and create `table` or `lex_less(eq)` constraints. 🙌

#MiniZinc #SmallWins

I really like the small optimizations I merged into MiniZinc. When you use the `in` or inequality operators on records or tuples, then the compiler will automatically try and create `table` or `lex_less(eq)` constraints. 🙌

#MiniZinc #SmallWins