Search in Artificial Intelligence - Calsoft Inc. Blog

Search is a key part of many AI problem-solving strategies that assist in exploring the problem spaces. As explained by Peter Norvig "Normal programming is telling the computer what to do when we know what to do. AI is when we tell the computer what to do when we don't know what to do." Search in AI provides as a first step to start solving many of the problems, either it is finding a sequence of next steps to perform by an agent or deciding on the next game move. Many search strategies are used in AI for efficient and goal-oriented searches. Let's have a look at a few popular AI search strategies: Breadth-First Search (BFS) is the most basic searches and it finds the shortest path with respect to a number of steps between the start and goal. Simple BFS does not consider any edge costs or weights.