Chris Angelico wrote:
Part of me is quaking in fear... the other part looking on in morbid fascination. Can you build a regexp that proves a Sudoku grid solvable?
Well, it's *theoretically* possible, since there are a finite number of possible sudoku puzzles, so if nothing else you could just use an RE that explicitly matched all the solvable ones. I wouldn't like to have to write that RE out by hand, though. -- Greg -- https://mail.python.org/mailman/listinfo/python-list
