3 ms·
Are those times for finding a solution, or for all solutions? If all, that is truly impressive! Dancing links is a backtracking algorithm, just a nice way to
by taeric 12y ago
Are those times for finding a solution, or for all solutions? If all, that is truly impressive!
Dancing links is a backtracking algorithm, just a nice way to optimize the backtracking.
- tacticiankerala 12y agoIt is for finding the first solution. Sorry that I didn't mention it.
- taeric 12y agoNo worries. I could have guessed, if I'd paid attention to how large of an N you looked at. :) Also, I should explicitly say thanks for sharing! It is fun reading solutions to this puzzle. Also fun to read Erlang.