Sudokus with minimum number of clues

Yesterday, I spotted on a Spanish post on the minimal number of clues to solve a Sudoku in a unique way. The original paper was posted on arXiv on January 1, in the Data structure and algorithms category. The authors, Gary McGuire, Bastian Tugemann, and Gilles Civario from University College Dublin, have shown by an exhaustive search that no Sudoku with 16 clues exist (in the sense of having a unique solution). The actual computation actually tooks 7.1 million core hours on the Stokes machine, which is a cluster with 320 nodes, which represents about a year in real time! The Sudoku solver the authors used was Brian Turner’s open source solver. (Here is a review of solvers.) Very impressive…

2 Responses to “Sudokus with minimum number of clues”

  1. There’s a ‘G’ missing in (it’s great to hear our little project is useful every once in a while :))

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: