Weekend Programming Challenge: Week 28 Sudoku Solver solutions


Image

We got 10 solutions! Which is great, now the students from my son University will have lot of example solutions which to use as good reference if their teacher give the same Sudoku solver homework next year🙂

  • Python x4
  • C++ x3
  • C x2
  • C# x1

All solutions are as usually on GitHub: https://github.com/OLIMEX/WPC/tree/master/ISSUE-28

3 Comments (+add yours?)

  1. kantal
    Oct 14, 2013 @ 23:09:24

    Hi!
    Looking through the solutions I noticed that using ‘deepcopy’ is unnecessary and so it is much faster. The corrections:
    #96
    if not p: return(sd)
    #107-111
    sd[y][x]=(i,0)
    nsd= sd
    next= step((x,y))
    if next: nsd= solve( next, nsd)
    if nsd: return( nsd)
    sd[y][x]=(0,0)

    Reply

  2. Richard Park
    Oct 15, 2013 @ 23:35:53

    Hey, U R right! There is no need to ‘deepcopy’.
    Writing 0 to unknown element saves a lot of computation time🙂

    Reply

    • kantal
      Oct 16, 2013 @ 12:51:53

      Yes. Originaly, I intended to write a generator function( I ‘ve already got it) but the code remains uncleaned.

      Reply

Leave a Reply

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

WordPress.com Logo

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

Twitter picture

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

Facebook photo

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

Google+ photo

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

Connecting to %s

%d bloggers like this: