[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-505022-105":59,"doc-detail-505022-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","peter-j-stuckey-minizinc-challenge-2017","Peter J. Stuckey MiniZinc Challenge 2017","","Minizinc Challenge 2017 materials cover the event’s structure, benchmark scale, and scoring rules comparing every pair of solvers across instances with time-limit constraints and optimality/satisfiability/unsatisfiability checks. The document defines solver categories including fixed search, free search, parallel and portfolio approaches, open parallel search, and local search variants. It also lists 2017 benchmarks, MiniZinc global constraints, contestant solvers (official and unofficial), and organizers’ responsibilities, concluding with fixed-search and local-search result leaderboards with medal categories.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":20,"@type":76,"position":81},"https://docshare.wps.com/document/exam/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/peter-j-stuckey-minizinc-challenge-2017/505022/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/peter-j-stuckey-minizinc-challenge-2017/505022.png","ImageObject",300,407,{"name":92,"@type":93},"Jake","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-21","2026-10-04",true,{"@type":102,"interactionType":103,"userInteractionCount":24},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"How does the scoring system compare solvers in MiniZinc Challenge 2017?","Question",{"text":112,"@type":113},"Each instance compares every pair of solvers. A solver earns 1 point for every opponent it beats within the time limit. If both finish by proving optimality/satisfiability/unsatisfiability, solver 1 receives t2/(t1+t2) points.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What is the entry system for solver writers?",{"text":117,"@type":113},"Writers download a VM, install the solver inside it, run a test script on the 2016 challenge subset, and upload the VM. The organizers then run the same script on 2017 problems, with permission noted for making VMs available.",{"name":119,"@type":110,"acceptedAnswer":120},"Which solver categories are included in the competition?",{"text":121,"@type":113},"Categories include single engine fixed search, single engine free search, single engine parallel search, open parallel search, and local search for nominated solvers, including portfolio-style and parallel variants.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},505022,1791513106,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":24,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":56,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":143,"read_time":144},962084928904,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","Min Zinc  \nChallenge 2017  \nPeter J. Stuckey  \nPeter J. Stuckey MiniZinc Challenge 2017  \nChallenge 2017  \n20 benchmarks * 5 instances = 100 instances 20 minutes time limit  \nScoring system:  \neach instance compares each pair of solvers  \n1 point for every solver you beat  \nIf both prove optimality/satisfiability/unsatisfiablitiy in time t1 and t2  \nSolver 1 gets t2/(t1+ t2) points  \nFive categories:  \nsingle engine fixed search: single solving algorithm, must follow given search strategy  \nsingle engine free search: search however you want  \nsingle engine parallel search: free search on 4 CPUs with hyper threading (8 threads)  \nopen parallel search: parallel search including portfolio solvers  \nlocal search: free search for local search (nominated) solvers  \nPeter J. Stuckey MiniZinc Challenge 2017  \nEntry System  \nVM based solver installation  \n• solver writers download VM  \n• install solver in VM  \n• run test script on 2016 challenge subset  \n• upload VM  \n• we run same script on 2017 problems  \n• This year we remembered to ask permission to make the VMs available  \nPeter J. Stuckey MiniZinc Challenge 2017  \n2017 Benchmarks  \nNEW  \ncity-position community-det crosswords groupsplitter hrc  \nma-path-finding opt-cryptanalysis rel2onto routing-flexible steelmillslab  \ntc-graph-color  \nplacement problem  \nsupervised community-detection make a puzzle  \nscheduling into groups  \nhospital resident couples assignment multi-agent path finding cryptanlysis optimization version mapping relations to ontologies pipe routing in plant design  \nslab design  \ntransition of graph coloring  \ncombinatorial, MIN real world, MAX combinatorial, MAX  \ncombinatorial, MIN real world, MIN combinatorial, MIN real world, MAX  \nreal world, MIN  \nreal world, MIN benchmark, MIN combinatorial, MIN  \nOLD problems (mainly new instances)  \ncargo, gbac, jp-encoding, mario, opd, rcpsp-wet, road-cons, tdtsp, travelling-tppv  \nPeter J. Stuckey MiniZinc Challenge 2017  \nGlobals  \n• alldifferent  \n• bin  packing  load  \n• count  \n• cumulative  \n• diffn  \n• element  \n• global  cardinality  \n• increasing  \n• inverse  \n• lex  greatereq  \n• regular  \n• table  \nPeter J. Stuckey MiniZinc Challenge 2017  \nThe official contestants  \nchoco 4 and 5: Java based trailing FD solver  \nconcrete: Scala based FD solver  \nhaifaCSP: C++ FD learning solver  \nizplus: C based hybrid FD/local search solver  \njacop: Java based trailing FD solver  \nmistral: C++ based trailing FD solver  \nor tools: C++ based FD solver  \nor tools LCG: C++ LCG based FD solver  \noscar: local search solver for MiniZinc (Scala)  \npicat-CP: trailing CLP(FD) solver  \npicat-SAT: translation to SAT approach to FD solving  \nsicstus-prolog: prolog based trailing CLP(FD) solver  \nsunny-cp-less: portfolio solver (no G12 solvers involved): choco, gecode,  \nhaifaCSP, jacop, izplus, minisatID, mistral, opturion  cpx, or_tools, picat yuck: local search solver for MiniZinc (Scala)  \nPeter J. Stuckey MiniZinc Challenge 2017  \nThe unofficial contestants  \ncbc: open source MIP solver (new linearisation)  \nchuffed: C++ based trailing lazy clause generation solver  \ng12-fd: Mercury and C based trailing FD solver  \ngecode: C++ based copying FD solver  \ngurobi: commercial MIP solver (new linearisation)  \nsunny-cp: portfolio solver using chuffed, gecode, g12fd, g12  cpx, g12-lazyfd, gurobi, choco, haifaCSP, minisatID, mistral, opturion  cpx, or tools, izplus, picat  \nLCG-glucose: C++ LCG solver based on glucose SAT solver  \nPeter J. Stuckey MiniZinc Challenge 2017  \nThe hard worker(s)  \nAndreas Schutt  \n• Managing entrants  \n• Running the competition and the preliminary round checking  \n• Handling submitted problems (fixing them up and suggesting instances to judges)  \n• Setting up the VM  \n• Scripts, webpage  \n• Checking validity (examining the results in detail)  \nGleb Belov, Thibaut Feydy, David Hemmi, Guido Tack,  \n• Problem checking  \n• Setting up the machines  \n• Installing local solvers  \nThank you for all your hard work!  \nPet","cbCaisuGqYulLGAg","https://ap.wps.com/l/cbCaisuGqYulLGAg","pdf",277830,"English","# Overview\n## Scoring system\n## Entry system\n## Categories of solvers\n# 2017 Material\n## Benchmarks\n## Globals\n# Participants and Results\n## Official contestants\n## Unofficial contestants\n## Hard worker(s)\n## Fixed search category\n## Local search category","[{\"question\":\"How does the scoring system compare solvers in MiniZinc Challenge 2017?\",\"answer\":\"Each instance compares every pair of solvers. A solver earns 1 point for every opponent it beats within the time limit. If both finish by proving optimality/satisfiability/unsatisfiability, solver 1 receives t2/(t1+t2) points.\"},{\"question\":\"What is the entry system for solver writers?\",\"answer\":\"Writers download a VM, install the solver inside it, run a test script on the 2016 challenge subset, and upload the VM. The organizers then run the same script on 2017 problems, with permission noted for making VMs available.\"},{\"question\":\"Which solver categories are included in the competition?\",\"answer\":\"Categories include single engine fixed search, single engine free search, single engine parallel search, open parallel search, and local search for nominated solvers, including portfolio-style and parallel variants.\"}]","Peter J. Stuckey MiniZinc Challenge 2017 | PDF",1791086324,48]