Path: ...!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Mild Shock Newsgroups: comp.lang.prolog Subject: Re: ANN: Dogelog Player 1.1.6 (HTTP Client) Date: Wed, 13 Mar 2024 02:02:36 +0100 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Wed, 13 Mar 2024 01:02:35 -0000 (UTC) Injection-Info: solani.org; logging-data="1362167"; mail-complaints-to="abuse@news.solani.org" User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Firefox/91.0 SeaMonkey/2.53.18.1 Cancel-Lock: sha1:vJEnZ/axsz//e9xFCKShWTNQ0Zw= In-Reply-To: X-User-ID: eJwNyskBwCAIBMCWRGFXyuGQ/ktI5j12ICgqDGpj8zbk3XYeeKpmSZW8EPMcnx7uWLG4/0GGOlsFt/iayNj4AFxNFao= Bytes: 2146 Lines: 28 In 1997, Hong Kong judge Wayne Gould saw a partly completed puzzle in a Japanese bookshop. Over six years, he developed a computer program to produce unique puzzles rapidly. The program tries to keep one puzzle ahead of you, by generating the next puzzle while you are solving the present one. In the following we show a Prolog program, where the random generation of a Puzzle is performed in less than 2 seconds. The Prolog program was mainly developed for Dogelog Player. We could test the Prolog program also with Prolog systems such as SWI-Prolog, Scryer Prolog and Trealla Prolog. The smallest domain first variable ordering heuristic allowed us to solve some hard problems below a minute. Turning the heuristic into a static ordering before search gave us a further boost and the baseline for randomization. Measurement showed that solving blank Sudokus doesn't have a large time variation. See also: Birthday Paradox and Sudoku Generation https://twitter.com/dogelogch/status/1767714755827908991 Birthday Paradox and Sudoku Generation https://www.facebook.com/groups/dogelog