1. Maze Design Presentation Questions
1. What is a Heuristic function?
-A heuristic function is a function that ranks alternatives in search algorithms at each node based on available information to decide which node to visit next
2. What is a perfect maze?
-A maze without any loops, one way to reach the exit and no inaccessible areas.
3. What is the time complexity of the Depth First Search Algorithm?
-O(|V|+|E|) big o notation
4. Depth-First Search and Breadth-First Search are examples of ___________ algorithms.
-Brute Force / Exhaustive Search
5. Name 3 Real Life applications of pathfinding algorithms.
-Navigation, Artificial Intelligence/Robotics, Computer Games, Computer Simulations, Virtual Reality, Military