I can demonstrate using Python for solving combinatorial constraint puzzles like 8 Queens, Suduko, and Minesweeper. I feel especially eager to show it after having written 2 days ago a minsweeper that does all the simple bookkeeping of flags recursively - with pygtk interface in 220 lines.
I'll exploit some advanced data structures (e.g. sets and heaps), and recursion tricks for interesting search algorithms. I'll come prepared with ready solutions (and some GUI for visualization) by I'll try to improvising with participation of listeners. You are all welcome to send me now problems you want to see solved (or challenge me on the spot). -- Beni Cherniavsky <[EMAIL PROTECTED]>, who can only read email on weekends. Governments are like kernels - everything possible should be done in user space.
