David Eppstein, a computer science professor, blogs about algorithms, graph theory, data structures and complexity.
HN commenters link his posts on cuckoo filters, A* as Dijkstra with modified weights, Sudoku complexity and Algorithm X.
Cool, this.
A very nifty (if somewhat detailed) complexity analysis of the Algorithm X appeared in blogosphere's festschrift for Knuth's 70, http://11011110.livejournal.com/128249.html
I've used P159 in my absolutely first assignment in the intro programming class. I was to make a N-queens solver. The assignment obviously asked for a 8-line backtracking program. But I was naïve. I went to the library and turned it inside out. My solution was ca. 500 lines, and also implemented a way to find the number of solutions without computing them (this was from IIRC a paper by Rivin), and had a randomized mode which would find just a single solution but for fast for very large N (this I found in Norvig's AIMA in a footnote referencing a paper by J.M., I don't remember the page or the full name)). Good times.
Whenever considering a bloom filter also look at cuckoo filters. There are pros and cons of each approach.
See https://bdupras.github.io/filter-tutorial/ and http://11011110.livejournal.com/327681.html as well as the corresponding HN discussions https://news.ycombinator.com/item?id=12124722 and https://news.ycombinator.com/item?id=11795779
That strikes me as extremely unlikely.
I think the complexity class of Sudoko is NP-Complete (a quick google confirms it's not exactly NP but very close: http://11011110.livejournal.com/23221.html?thread=19381 -- complexity is the same as solving SAT problems which have only one unique solution)
"When one says Sudoku is NP-complete, one should keep in mind that this refers only to an unusual type of Sudoku puzzle in which there might be multiple solutions."
http://11011110.livejournal.com/23221.html
Another way of looking at it: A* is Dijkstra where the edge weights have been modified. http://11011110.livejournal.com/135302.html