A practical demonstration on search algorithms using VisualGo tool. Used search algorithms to solve the real world problem- Family bridge crossing problem. Algorithms used: Breadth-First Search, Depth-First Search, Dijkstra Search

1. AI Search Algorithms
JKC SHAYALIKA – M.SC (AI) BATCH 11
ESSENTAILS OF ARTIFICIAL INTELLIGENCE
-PRACTICAL APPROACH-

2. Bridge and torch problem-Conditions
 Four People crossing bridge at night.
 There’s 1 lamp. 4 people could cross the bridge.
 A maximum of 2 persons can cross at one time, and they must have the lamp
with them.
 Each person walks at different speeds: 1sec, 3sec, 6sec,8sec.
 A pair must walk together at the rate of the slower person.
 The lamp is enough for 20 minutes only.

3. Input State Output State

4. State Space (simplified)

5. Tool Used- visualgo.net
 https://visualgo.net/en
 Visualgo.net is a web based learning media which has a function to
visualize many kind of algorithm and data structure.
 VisuAlgo was conceptualised in 2011 by Dr Steven Halim as a tool
to help his students better understand data structures and
algorithms, by allowing them to learn the basics on their own and
at their own pace.
 VisuAlgo is an ongoing project and more complex visualisations
are still being developed.

6. Visual Algo
Landing Page

7. Drawing the Graph

8. Solve Using Breadth-First Search

10. Solve Using Depth-First Search

12. Solve Using A* Search

14. Conclusion
 Dijkstra Algorithm will reach the goal in small time , less no of steps
compared with BFS, DFS.

15. THANK YOU