{"push_id":1154449629,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7ca48c26b5ee66c495182e2d67a2b464f6b5dfdc","before":"9f18ff323dc8b4aae3ade7f383a590860620e338","commits":[{"sha":"7ca48c26b5ee66c495182e2d67a2b464f6b5dfdc","author":{"name":"Vincent Foley","email":"17293d03abe415555200de457c5039e63653b05c@gmail.com"},"message":"Improve selection of cell to brute force\n\nPreviously, after the set propagation, the next unsolved cell was\nselected, a candidate value was chosen and we tried to solve from\nthere.  This commit introduces a new method, `most_promising`\n(name might change), which selects the first unsolved cell that has the\nfewest number of candidates.  This improves performance on problems.txt\nby a factor of nearly 2.5x (run-time reduced from ~1m40s to ~0m41s).","distinct":true,"url":"https://api.github.com/repos/gnuvince/sudoku-rs/commits/7ca48c26b5ee66c495182e2d67a2b464f6b5dfdc"}]}
{"actor":{"display_login":"gnuvince"}}