000132775 001__ 132775 000132775 005__ 20240315113107.0 000132775 0247_ $$2doi$$a10.1007/11870814_13 000132775 0248_ $$2sideral$$a57250 000132775 037__ $$aART-2006-57250 000132775 041__ $$aeng 000132775 100__ $$aSudokus and Gröbner Bases: Not Only a Divertimento 000132775 245__ $$a10.1007/11870814_13 000132775 260__ $$c2006 000132775 5203_ $$aSudoku is a logic-based placement puzzle. We recall how to translate this puzzle into a 9-colouring problem which is equivalent to a (big) algebraic system of polynomial equations. We study how far Gröbner bases techniques can be used to treat these systems produced by Sudokus. This general purpose tool can not be considered as a good solver, but we show that it can be useful to provide information on systems that are —in spite of their origin— hard to solve. 000132775 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/ 000132775 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion 000132775 773__ $$g4194 (2006), 155-165$$pLect. notes comput. sci.$$tLecture Notes in Computer Science$$x0302-9743 000132775 8564_ $$s157953$$uhttps://zaguan.unizar.es/record/132775/files/texto_completo.pdf$$yPostprint 000132775 8564_ $$s1422075$$uhttps://zaguan.unizar.es/record/132775/files/texto_completo.jpg?subformat=icon$$xicon$$yPostprint 000132775 909CO $$ooai:zaguan.unizar.es:132775$$particulos$$pdriver 000132775 951__ $$a2024-03-15-08:49:08 000132775 980__ $$aARTICLE