Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #19495
| From | Blockheads Oi Oi <breamoreboy@yahoo.co.uk> |
|---|---|
| Subject | constraint based killer sudoku solver performance improvements |
| Date | 2012-01-26 18:21 +0000 |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.5132.1327602104.27778.python-list@python.org> (permalink) |
I have a working program based on [1] that sets up all different constraints for each row, column and box and then sets exact sum constraints for each cage. It'll run in around 0.2 secs for a simple problem, but a tough one takes 2 hours 45 minutes. I did some research into improving the performance and found [2] but can't work out how to implement the constraints given. Can someone please help, assuming that it's even possible. [1] http://pypi.python.org/pypi/python-constraint/1.1 [2] http://4c.ucc.ie/~hsimonis/sudoku.pdf -- Cheers. Mark Lawrence.
Back to comp.lang.python | Previous | Next | Find similar | Unroll thread
constraint based killer sudoku solver performance improvements Blockheads Oi Oi <breamoreboy@yahoo.co.uk> - 2012-01-26 18:21 +0000
csiph-web