Rathnayake, B. R. M. S. R. B.Marzuk, HSenadheera, R. I. AVijeyakumar, SAbeygunawardhana, P. K. W2022-06-162022-06-162021-08-11B. R. M. S. R. B. Rathnayake, H. Marzuk, R. I. A. Senadheera, S. Vijeyakumar and P. K. W. Abeygunawardhana, "Analysis of Searching Algorithms in Solving Modern Engineering Problems," 2021 10th International Conference on Information and Automation for Sustainability (ICIAfS), 2021, pp. 123-128, doi: 10.1109/ICIAfS52090.2021.9606040.2151-1810https://rda.sliit.lk/handle/123456789/2627Many current engineering problems have been solved using artificial intelligence search algorithms. To conduct this research, we selected certain key algorithms that have served as the foundation for many other algorithms present today. This article exhibits and discusses the practical applications of A*, Breadth-First Search, Greedy, and Depth-First Search algorithms. We looked at several recent research publications on these algorithms (for example, maze solver robots, the eight-puzzle problem, medication prediction, and travel advice) and critically examined their benefits, drawbacks, and challenges. We’ve also done some experimentation with a Python application to see how well these algorithms perform.enAnalysisSearching AlgorithmsSolvingModern EngineeringProblemsArticle10.1109/ICIAfS52090.2021.9606040