3 ms·
If you are just looking for a solution, DLX is already absurdly fast. Granted, as N grows exceptionally large, it may be that it is also absurdly memory hungry
by taeric 12y ago
If you are just looking for a solution, DLX is already absurdly fast. Granted, as N grows exceptionally large, it may be that it is also absurdly memory hungry. :)
Also note, that it isn't even the best algorithm around. Just pretty good.