To give orientation here Uncle Bob introduced his heuristic "Transformation Priority Premise", which basically classifys and prioritizes possible next implementations by their complexity. A nice side-effect of following the approach: Developing complex algorithms incrementally becomes very similar to writing a mathematical proof. Be surprised!

As always after a short introduction we will start trying the approach on an algorithmic coding kata hands-on in pairs. So please bring your laptop with a running IDE and a unit test framework in the language of your choice.