Brute Force Algorithms In AI Are Easy But Not Smarticle, Use Them Wisely In Driverless Cars

Dr. Lance Eliot, AI Insider

When my children were young, they used to enjoy playing hide-and-seek with each other. At times, they would look in every nook and corner, including places that would not accommodate hiding. This was an approach sometimes considered an “exhaustive search” in computer science, meaning that you search high and low, doing so without any particular rhyme or reason to the search other than focusing on simply conducting the search.

Eventually, as the kids got older, they realized that it would be prudent to search in a more refined manner, such as not looking in places that weren’t large enough to hide. Plus, they at first had always started searching indoors and then gone outdoors, but they each realized this and had opted often to hide outdoors, doing so to lengthy their hiding time, but they both also caught onto their each behaviors and so tended to switch toward looking outdoors first and then looking indoors.

As an AI developer, I was fascinated in the evolution of their playing this hide-and-seek game.

When they were young and first discovering how to play the game, they pretty much did an exhaustive kind of search, doing so in a brute force manner.