Project - Artificial Intelligence - ثالث ثانوي

Project 1 Modify the code of the weighted BFS and A* Search algorithms by changing the horizontal and vertical weights to 3 and the diagonal weights to 5. Also change the starting point to (7, 2). 2 What is the new shortest distance path and the number of cell visits of the unweighted versions of the BFS and A* Search algorithms with the constant heuristic function? Find these values and present your observations. 3 Follow the same steps for the weighted versions of the BFS and A* Search algorithms with the constant heuristic function. 4 وزارة التعليم Ministry of Education 130 2024-1446 Repeat the process for the unweighted and weighted versions of the A* Search algorithms with the manhattan heuristic function.

Wrap up Now you have learned to: > Employ recursion to solve problems. > Apply advanced graph traversing algorithms. > Implement both simple and advanced rule-based systems. > Design an Al model. > Measure the effectiveness of your Al model. > Use search algorithms to solve simulations of real-life problems. KEY TERMS Ministry of Education 2024-1446 A* Search Algorithm Performance Breadth-First Search (BFS) Confusion Matrix Depth-First Search (DFS) Informed Search Knowledge Base Maze Solving Model Training Path Finding Recursion Rule-Based Systems Scoring Function Search Algorithms Uninformed Search Unweighted Graph Weighted Graph Heuristic Function 131