Sudoku Programmers Forum Index

 
 FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister   ProfileProfile   Log inLog in          Games  Calendar

Log in to check your private messagesLog in to check your private messages   

NEWS:
Least square method

 
Post new topic   Reply to topic    Sudoku Programmers Forum Index -> Programming sudoku
View previous topic :: View next topic  
Author Message
ChPicard

Joined: 12 Mar 2008
Posts: 147
:
Location: Montreal, Canada

Items
PostPosted: Sun Feb 13, 2011 10:51 am    Post subject: Least square method Reply with quote

Hi

I remember that when I was young, now I am sixty years old, I used the least square method to solve a crystal structure in radiocrystallography. I am wondering if it is possible to use such a technique to find new 17 given sudokus.

Good weekend

JPS
Back to top
View user's profile Send private message
dpbobelisk

Joined: 27 Apr 2006
Posts: 143
:
Location: Middle England

Items
PostPosted: Sun Feb 13, 2011 12:23 pm    Post subject: Reply with quote

JPS, I only have dim recollections of crystallography, but while crystallographers look for planes of alignment, Sudoku puzzles require digits to be misaligned in every possible direction. Can you elaborate a little on where you sense the parallels and what values we might plug into the least squares method please?

At first sight it seems you're looking to reduce the solution path using probabilities is that right?

[Edit] Now the penny's dropped! You're a month and a half or so early and are talking of the cellular squares method.
Back to top
View user's profile Send private message
djconnel

Joined: 01 Aug 2012
Posts: 1
:
Location: San Francisco, CA

Items
PostPosted: Wed Aug 01, 2012 2:35 am    Post subject: Reply with quote

This is an interesting subject. But viewing a puzzle crystallographically, a solution has zero entropy. Real crystals formed at finite temperature have a finite density of defects. Here defects aren't allowed!

I have not studied Sudoku solver methods: only the one described in The Ruby Programming Language, which is basically to always guess on the cell with the least number of legal possibilities. For large puzzles it doesn't do so well, however (for example, 36x36). It tends to get into dead ends from which it takes millions of iterations, or more, to extract itself.

I think what you propose is more of a long-range order sort of thing: throw down cell values then "anneal out the defects". Since there is so much long-range order in Sudoku, I'm not sure how well this would work...

Anyway, I need to see some of the other threads to see what people describe.
Back to top
View user's profile Send private message
Display posts from previous:   
Post new topic   Reply to topic    Sudoku Programmers Forum Index -> Programming sudoku All times are GMT
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
Sudoku Programmers topic RSS feed 


Powered by phpBB © 2001, 2005 phpBB Group

Igloo Theme Version 1.0 :: Created By: Andrew Charron
FREE FORUM HOSTING by AtFreeForum. Terms of Service - Privacy Policy
FASHION ACCESSORIES - BLING BLING - LADIES WATCHES - KOREAN CHILDREN CLOTHING - ONLINE BARGAIN STORE - FASHION JEWELLERIES