In this essay I tackle the problem of solving every Sudoku puzzle. It turns out to be quite easy […] using two ideas: constraint propagation and search.
Solving Every Sudoku Puzzle – Classic algorithm to tackle sudoku once and for all.
Monthly Archives: October 2010
julien - - Uncategorized - Leave a reply
How does it work? […] Given a word, we are trying to choose the most likely spelling correction for that word. […] We are trying to find the correction c, out of all possible corrections, that maximizes the probability of c given the original word w.
How to Write a Spelling Corrector – a nice Bayesian algorithm, and 21 lines of Python.
Ca fait 3 jours que je ne me lasse pas de ces photos – On Set: Empire Strikes Back | Vanity Fair