LAUSR

The objective of this paper is to present different artificial-intelligence-based heuristic searching algorithms, such as the ones in this paper: the breadth-first search (BFS), depth-first search (DFS), Best-First Search, and A* and AO* searching techniques. The BFS and DFS help solve puzzles and simple Caesar cipher substitution problems. In this paper, plain text is obtained from the given cipher text using the BFS and DFS. The A* approach is used to solve puzzles and find the best path between a start city and a destination city. Finally, the AO* algorithm graph is drawn to find a vehicle in heavy traffic in cities. It is justified that the artificial intelligence tools discussed in this paper are successfully used to solve cryptographic problems, puzzles, path finding and vehicle detection.