Life Lesson learnt whilst studying CS : Backtracking
âBacktracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point of timeâ
Today I was solving backtracking algorithm related questions and I realised just as we in CS solve problems using this technique incrementally, we must emulate that same pattern in life to ensure our intended results. Just as a rat in a maze doesnât stop moving and adjusts their direction, we in life must see all rejections as redirections.Â
Consistent redirections without losing enthusiasms is what led the proverbial rat to the end of the maze.Â
But, there is a catch here. The rat remembers its past moves and builds upon them. Even though it may lead to an imminent stone wall, the rat moves with equal enthusiasm till the end of the road. The rat systematically weeds out failed routes, remembers them and moves with the same conviction to find the route that gets it to the end of the maze.Â
Just like the rat, we must be mindfully making logical decisions and going about our days in a systemic fashion.
Backtracking can be defined as a general algorithmic technique that considers searching every possible combination in order to solve a computational problem.Â
Search every nook, every cranny. Knock on every door. Do what needs to be done. But NEVER give up.
