In the fourth part of my video lecture series introducing the Standard Template Library, I walk through an extended example of using the STL to solve Nurikabe puzzles. It assumes that you’ve read Wikipedia’s Nurikabe page, and that you’ve watched Part 1 (sequence containers), Part 2 (associative containers), and Part 3 (smart pointers), or that you’re already familiar with those topics.
In Part 5 (which was filmed back-to-back; it’s in the editing pipeline), I’ll explain how I implemented the advanced analysis in my Nurikabe solver, including the first breadth-first search that I ever wrote.
Stephan T. Lavavej
Visual C++ Libraries Developer