Artificial-intelligence-based heuristic searching tools and knowledge representation to solve cryptography problems, puzzles, vehicle detection and path finding Online publication date: Wed, 14-Jun-2017
by S.P. Raja; T. Dhiliphan Rajkumar; K. Sowndariya
International Journal of Signal and Imaging Systems Engineering (IJSISE), Vol. 10, No. 1/2, 2017
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Signal and Imaging Systems Engineering (IJSISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook