In this post, we optimize our brute force search for solutions to n-queens problems for a few small boards.
In this post, we take the brute force and other abstractions we created earlier, to solve the n-queens problem for a relatively small n.
A series of posts on solving problems with simple yet powerful abstractions in Python. We explore a few algorithms.
Earlier, we added a few abstractions to brute-force search. Now, we add yet another abstraction and unlock a wide range of possibilities.
In part 2, we test our initial abstraction with a few additional problems. In the process, we figure out a few more useful abstractions.
Writing simple but powerful abstractions is a necessary skill in software. We start with a simple abstraction that solves a few problems.
In a previous post, we were introduced to the Recall app that was built with Cycle.js. A couple of people were interested to know how to…