Path: csiph.com!usenet.pasdenom.info!news.redatomik.org!newsfeed.xs4all.nl!newsfeed1.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.117 X-Spam-Level: * X-Spam-Evidence: '*H*': 0.77; '*S*': 0.00; 'grid': 0.09; 'cc:addr :python-list': 0.11; 'posted': 0.15; 'clues': 0.16; 'from:addr:rosuav': 0.16; 'from:name:chris angelico': 0.16; 'wrote:': 0.18; 'thu,': 0.19; '(the': 0.22; 'example': 0.22; 'cc:addr:python.org': 0.22; 'cc:2**0': 0.24; 'shown': 0.26; 'values': 0.27; 'header:In-Reply-To:1': 0.27; 'am,': 0.29; 'message-id:@mail.gmail.com': 0.30; 'quite': 0.32; 'test': 0.35; 'received:google.com': 0.35; 'in.': 0.36; 'possible': 0.36; 'minimum': 0.38; 'filled': 0.38; 'expect': 0.39; 'does': 0.39; 'how': 0.40; 'ian': 0.60; 'times': 0.62; "you'll": 0.62; "you've": 0.63; 'mar': 0.68; '26,': 0.68; 'million': 0.74; '2015': 0.84; 'solvable': 0.84; 'to:none': 0.92 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:cc :content-type; bh=8IP/+bQLruCnx4zN2jG7h5bouJ6b76lwmH0uYQF7ctM=; b=V9oX5L23RUc9zGQPLTfoNivSuIZSkyXM8xVtImck6MBqohb2WAslgAxk8o5hqrVZDV us0XwddZmof5hvvz8KAO8gDPefux6TRjvftPBfcvduxRPrQdD7DCYTRg1EMg5eHNLSyK aT9LimT72qtRmFf2GdBuONfq/uIWwZKkiAaAX/0eQbPzkvzfbls5TfNlXiUTNF4fkTP0 23rOJNMwhFzDcYXpStDr9ck2CQHOW6S5O8jrMY9ab02AC1+AP7L4GLbGm50UxnFvggaV seqH+QcU4p2L2+15nKxYcwP/Wo2j8jiaF5HBTFvKnLErc+8mmYni87c6Mz2rI7i6ePX8 0kyA== MIME-Version: 1.0 X-Received: by 10.107.160.212 with SMTP id j203mr16999393ioe.43.1427323232137; Wed, 25 Mar 2015 15:40:32 -0700 (PDT) In-Reply-To: <87iodoakft.fsf@elektro.pacujo.net> References: <87r3sdnw5t.fsf@elektro.pacujo.net> <4e81bdb9-52db-46e6-b449-d4241cb2a3f2@googlegroups.com> <87twx8amww.fsf@elektro.pacujo.net> <87iodoakft.fsf@elektro.pacujo.net> Date: Thu, 26 Mar 2015 09:40:32 +1100 Subject: Re: Sudoku solver From: Chris Angelico Cc: "python-list@python.org" Content-Type: text/plain; charset=UTF-8 X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.19 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 16 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1427323235 news.xs4all.nl 2861 [2001:888:2000:d::a6]:48136 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:87988 On Thu, Mar 26, 2015 at 7:31 AM, Marko Rauhamaa wrote: > Ian Kelly : > >> The test puzzle that you posted has 23 values already filled in. How >> does it perform on harder puzzles with only 17 clues (the proven >> minimum)? One would expect it to be around a million times slower. > > Just try it. The example had a minimum of clues (drop one clue and > you'll get multiple solutions). That's not quite what Ian meant. You've shown that your particular grid needs every clue to be solvable; Ian is pointing out that it's possible to create a solvable puzzle (one with a unique solution) with only 17 clues. ChrisA