Monthly Archives: November 2012

Artificial Intelligence – Breadth First Search(BFS)

In this post I will talk about the Breadth First Search algorithm for solving a search problem. Given below are the diagrams of the example search problem and the created search tree. If you don’t know what search problems are and how search trees are created visit this post. Breadth First Search Breadth First Search […]

Artificial Intelligence – Depth First Search(DFS)

Okay! So this is my first blog post! I will start by talking about the most basic solution to search problems, which are an integral part of artificial intelligence. What the hell are search problems? In simple language, search problems consist of a graph, a starting node and a goal(also a node). Our aim while […]