The Way
There are something (a generalized class of algorithms) called “backtracking search”. The main property is that an algorithm goes back onse a dead end is reached, or a certain threshold of maximum steps. There are two “strategies” for these algorithms (of how to expand the “fringe”) - one is called “depth-first”, another – “breadth-first”. The first one goes “fast” and “narrow” (inforamaly), where another one goes “slowly”, and “layer after layer”. ...