Home > Uncategorized > C++ Sudoku solver updated–optimized set implementation

C++ Sudoku solver updated–optimized set implementation

For Sudokus of moderate sizes it is possible to replace the standard set implementation and use the bits in an integer instead. The purpose of this would be to gain performance at the cost of limiting the board size to 32×32 (or 64×64 on a 64 bit processor). I tried it out today and the result was not bad at all; the optimized set implementation was more than twice as fast:

image

Again the source code is available on bitbucket.org:

https://bitbucket.org/d95danb/sudokucpp

I tagged the old version as 1.0 and this new optimized version as 2.0.

Advertisements
Categories: Uncategorized
  1. No comments yet.
  1. No trackbacks yet.

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: