PageSourceSearch

https://www.minizinc.org/_next/static/chunks/pages/challenge-000d7ce748277911.js

js minizinc.org collected 2026-10-01 11:37:44 UTC 10,532 bytes, 1 lines download raw bytes

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[8331],{22221:(e,n,s)=>{"use strict";s.r(n),s.d(n,{default:()=>u});var r=s(37876),l=s(77328),i=s.n(l),t=s(99638),a=s(85931),c=s(63141),h=s(37472);function d(){return(0,r.jsx)("section",{id:"challenge","aria-labelledby":"challenge-title",className:"py-6",children:(0,r.jsxs)(c.m,{children:[(0,r.jsx)("h2",{id:"challenge-title",className:"text-3xl font-medium tracking-tight text-gray-900",children:"The MiniZinc Challenge"}),(0,r.jsxs)("p",{className:"mt-4 leading-7",children:["The MiniZinc Challenge is an annual competition of constraint programming solvers on a variety of benchmarks. It has been held every year since 2008, with the winners being announced at the annual"," ",(0,r.jsx)(h.N,{href:"http://www.a4cp.org/events/cp-conference-series",children:"International Conference on Principles and Practice of Constraint Programming"}),"."]}),(0,r.jsx)("p",{className:"mt-4 leading-7",children:"If you use benchmarks from the MiniZinc Challenge in your publication or you want to have reference for the challenge, please refer to at least one of following publications."}),(0,r.jsxs)("ul",{className:"mt-4 ml-4 list-inside list-disc leading-relaxed",children:[(0,r.jsx)("li",{children:"Peter J. Stuckey, T. Feydy, A. Schutt, G. Tack, J. Fischer (2014). The MiniZinc Challenge 2008-2013. AI Magazine 35 (2), 55-60."}),(0,r.jsx)("li",{children:"Peter J. Stuckey, R. Becket, J. Fischer (2010). Philosophy of the MiniZinc challenge. Constraints 15 (3), 307-316."})]}),(0,r.jsxs)("p",{className:"mt-4 leading-7",children:["A list of all problems and MiniZinc globals used in previous challenges is available ",(0,r.jsx)(h.N,{href:"/challenge/globals",children:"here"}),"."]})]})})}var o=s(93829),x=s(23842);function m(){return(0,r.jsx)(c.m,{children:(0,r.jsxs)("section",{id:"medals","aria-labelledby":"medals-title",className:"py-6",children:[(0,r.jsx)("h3",{id:"medals-title",className:"text-2xl font-medium tracking-tight text-gray-900",children:"Medals"}),Object.keys(o.p0).sort((e,n)=>n.localeCompare(e)).map(e=>(0,r.jsxs)("div",{className:"mt-6",children:[(0,r.jsx)("h4",{className:"text-xl tracking-tight",children:(0,r.jsxs)(h.N,{href:`/challenge/${e}/results`,children:["MiniZinc Challenge ",e]})}),(0,r.jsx)(x.T,{className:"mt-4",medals:o.p0[e]})]},e))]})})}var g=s(39364);function j(){return(0,r.jsx)(c.m,{children:(0,r.jsxs)("section",{id:"medals","aria-labelledby":"medals-title",className:"py-6",children:[(0,r.jsx)("h3",{id:"medals-title",className:"text-2xl font-medium tracking-tight text-gray-900",children:"Current Challenge"}),(0,r.jsxs)("div",{className:"mt-6",children:[(0,r.jsxs)(h.N,{className:"text-xl tracking-tight",href:`/challenge/${o.ss}`,children:["MiniZinc Challenge ",o.ss]}),(0,r.jsx)("h4",{id:"announcements",className:"mt-4 text-xl font-medium tracking-tight text-gray-900",children:"Announcements"}),(0,r.jsx)("ul",{className:"mt-4 ml-4 list-inside list-disc leading-relaxed",children:g.p[o.ss].announcements.map((e,n)=>(0,r.jsx)("li",{children:e},n))}),(0,r.jsx)("h4",{id:"dates",className:"mt-4 text-xl font-medium tracking-tight text-gray-900",children:"Dates"}),(0,r.jsx)("ul",{className:"mt-4 ml-4 list-inside list-disc leading-relaxed",children:g.p[o.ss].dates.map((e,n)=>(0,r.jsx)("li",{children:e},n))})]})]})})}function u(){return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)(i(),{children:(0,r.jsx)("title",{children:"MiniZinc - Challenge"})}),(0,r.jsx)(a.Y,{}),(0,r.jsxs)("main",{children:[(0,r.jsx)(d,{}),(0,r.jsx)(j,{}),(0,r.jsx)(m,{})]}),(0,r.jsx)(t.w,{})]})}},23842:(e,n,s)=>{"use strict";s.d(n,{T:()=>i});var r=s(37876);let l=[{key:"fd",label:"Fixed"},{key:"free",label:"Free"},{key:"par",label:"Parallel"},{key:"open",label:"Open"},{key:"local",label:"Local Search"}];function i({className:e,medals:n,...s}){return(0,r.jsxs)("table",{className:e,children:[(0,r.jsx)("thead",{children:(0,r.jsxs)("tr",{className:"border-b",children:[(0,r.jsx)("th",{className:"px-2 py-1",children:"Category"}),(0,r.jsx)("th",{className:"px-2 py-1 text-yellow-500",children:"Gold"}),(0,r.jsx)("th",{className:"px-2 py-1 text-gray-500",children:"Silver"}),(0,r.jsx)("th",{className:"px-2 py-1 text-orange-800",children:"Bronze"})]})}),(0,r.jsx)("tbody",{children:l.filter(e=>e.key in n).map(e=>(0,r.jsxs)("tr",{children:[(0,r.jsx)("td",{className:"px-2 py-1",children:e.label}),(0,r.jsx)("td",{className:"px-2 py-1 text-yellow-500",children:n[e.key][0]||""}),(0,r.jsx)("td",{className:"px-2 py-1 text-gray-500",children:n[e.key][1]||""}),(0,r.jsx)("td",{className:"px-2 py-1 text-orange-800",children:n[e.key][2]||""})]},e.key))})]})}},39364:(e,n,s)=>{"use strict";s.d(n,{M:()=>t,p:()=>i});var r=s(37876),l=s(37472);let i={2026:(()=>{let e="Fri, 8 May 2026";return{announcements:[(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-07-23"})," Announcements of the results are"," ",(0,r.jsx)(l.N,{href:"/challenge/2026/results",children:"here"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-06-09"})," A typo in the rules regarding the command used for running solvers was corrected."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-04-23"})," Problem submission deadline extended."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-01-19"})," Official"," ",(0,r.jsx)(l.N,{href:"/challenge/2026/call_for_problems",children:"Call for Problems"})," ","for the MiniZinc Challenge."]})],problemSubmissionDeadline:e,minizinc:"2.9.7",dates:[(0,r.jsxs)(r.Fragment,{children:["Registration opens: ",(0,r.jsx)("strong",{children:"Now"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Problem submission deadline: ",(0,r.jsx)("s",{children:"Fri, 24 April 2026"})," ",(0,r.jsx)("strong",{children:e}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission begins: ",(0,r.jsx)("strong",{children:"Mon, 4 May 2026"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission deadline: ",(0,r.jsx)("strong",{children:"Fri, 19 June 2026"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Announcement of results at"," ",(0,r.jsx)(l.N,{href:"https://cp2026.a4cp.org/",children:"CP2026"}),":"," ",(0,r.jsx)("strong",{children:"20 - 23 July 2026"})," (Lisbon, Portugal)."]})]}})(),2025:(()=>{let e="Fri, 6 June 2025";return{announcements:[(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-01-14"})," Amendment made to the results to fix an issue with undetected incorrect optimality claims. Thanks to Alessio Pellegrino for reporting."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-09-15"})," Announcements of the results are"," ",(0,r.jsx)(l.N,{href:"/challenge/2025/results",children:"here"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-05-16"})," The tie-breaking procedure for incomplete scoring has been updated in the"," ",(0,r.jsx)(l.N,{href:"/challenge/2025/rules#incomplete-scoring-procedure",children:"rules"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-05-16"})," Problem submission deadline extended."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2025-02-11"})," Official"," ",(0,r.jsx)(l.N,{href:"/challenge/2025/call_for_problems",children:"Call for Problems"})," ","for the MiniZinc Challenge."]})],problemSubmissionDeadline:e,minizinc:"2.9.3",dates:[(0,r.jsxs)(r.Fragment,{children:["Registration opens: ",(0,r.jsx)("strong",{children:"Now"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Problem submission deadline: ",(0,r.jsx)("s",{children:"Fri, 16 May 2025"})," ",(0,r.jsx)("strong",{children:e}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission begins: ",(0,r.jsx)("strong",{children:"Mon, 26 May 2025"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission deadline: ",(0,r.jsx)("strong",{children:"Fri, 11 July 2025"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Announcement of results at"," ",(0,r.jsx)(l.N,{href:"https://cp2025.a4cp.org/",children:"CP2025"}),":"," ",(0,r.jsx)("strong",{children:"10 - 15 August 2025"})," (Glasgow, Scotland)."]})]}})(),2024:(()=>{let e="Fri, 28 June 2024";return{announcements:[(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2026-01-14"})," Amendment made to the results to fix an issue with undetected incorrect optimality claims. Thanks to Alessio Pellegrino for reporting."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-09-05"})," Announcements of the results are"," ",(0,r.jsx)(l.N,{href:"/challenge/2024/results",children:"here"}),"."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-07-15"})," Update the"," ",(0,r.jsx)(l.N,{href:"/challenge/2024/docker",children:"Docker image preparation instructions"})," ","to fix some minor errors."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-06-03"})," Problem submission deadline extended."]}),(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)("strong",{children:"2024-02-12"})," Official"," ",(0,r.jsx)(l.N,{href:"/challenge/2024/call_for_problems",children:"Call for Problems"})," ","for the MiniZinc Challenge."]})],problemSubmissionDeadline:e,minizinc:"2.8.5",dates:[(0,r.jsxs)(r.Fragment,{children:["Registration opens: ",(0,r.jsx)("strong",{children:"Now"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Problem submission deadline: ",(0,r.jsx)("s",{children:"Fri, 7 June 2024"})," ",(0,r.jsx)("strong",{children:e}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission begins: ",(0,r.jsx)("strong",{children:"Mon, 17 June 2024"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Solver submission deadline: ",(0,r.jsx)("strong",{children:"Fri, 2 August 2024"}),"."]}),(0,r.jsxs)(r.Fragment,{children:["Announcement of results at"," ",(0,r.jsx)(l.N,{href:"https://cp2024.a4cp.org/",children:"CP2024"}),":"," ",(0,r.jsx)("strong",{children:"2 - 6 September 2024"})," (Girona, Catalonia)."]})]}})()};function t(e){let n=e-2008+1,s=n%100;if(s>3&&s<21)return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"th"})]});switch(s%10){case 1:return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"st"})]});case 2:return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"nd"})]});case 3:return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"rd"})]})}return(0,r.jsxs)(r.Fragment,{children:[n,(0,r.jsx)("sup",{children:"th"})]})}},98179:(e,n,s)=>{(window.__NEXT_P=window.__NEXT_P||[]).push(["/challenge",function(){return s(22221)}])}},e=>{e.O(0,[7725,8805,6701,4040,6958,636,6593,8792],()=>e(e.s=98179)),_N_E=e.O()}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.