My favorite way to solve constraint satisfaction problems is by using the the excellent CLP(FD) or CLP(Z) libraries for Prolog.

A sudoku solver can be written in just a few lines [1].

[1]: https://github.com/triska/clpfd/blob/master/sudoku.pl

> For a junior programmer, a programming language is something like Angular or Blockchain, while for a senior developer, a language is Ruby or Python.

What?

Also:

> A data structure is a linked list, a red-black tree, or another data structure.

Seems we have a recursive definition here

It's a joke, like about half of the article. There's some non-humor value to the whole thing too, though, if you get far enough in.

I didn't realize it was a joke until I saw the author's newsletter about it today. Should've caught it earlier, though, given how different it is from his usual high quality.

https://buttondown.email/hillelwayne/archive/new-essay-and-t... seems to be the newsletter in question; I am not subscribed despite fitting the demographics on a number of axes.

Indeed. It's generally an interesting newsletter, covers some interesting topics.

For something equally as unreadable as J, try APL! http://dfns.dyalog.com/n_sudoku_bfs.htm

Norvigs Sudoku solver: https://norvig.com/sudoku.html