If the Sudokus were *really* huge I bet the MIP would win ;-)
On Tue, Jul 1, 2014 at 6:06 PM, Iain Dunning <[email protected]> wrote: > Hah I'm actually surprised there isn't more of a performance gap for the > MIP formulation, thats kinda cool. > > > On Tuesday, July 1, 2014 1:37:00 PM UTC-4, andy hayden wrote: > >> I recently ported Norvig's Solve Every Sudoku Puzzle >> <http://norvig.com/sudoku.html> to Julia: https://github.com/ >> hayd/Sudoku.jl >> >> Some simple benchmarks suggest my Julia implementation solves around 20% >> slower* than the Python version, and 3 times faster than the implementation >> on JuMP (vendorized from the latest release), against the random puzzles. I >> tried to include the solver from attractivechaos/plb >> <https://github.com/attractivechaos/plb/tree/master/sudoku> but couldn't >> get it working for comparison... >> >> I'm new to Julia so would love to hear people's thoughts / any >> performance tips! >> I've not delved too deeply into the Profile, but @time suggests 10% of >> time is GC. >> >> **I'm sure I've lost some performance in translation which could be >> easily sped up...* >> >> Best, >> Andy >> >
