ECE 457 Project 1 Search Heuristics - ECE 457 Applied Artificial Intelligence Project 1 Search Heuristics Introduction The purpose of this project is to

ECE 457 Project 1 Search Heuristics - ECE 457 Applied...

This preview shows page 1 - 2 out of 3 pages.

ECE 457 Applied Artificial Intelligence Project 1: Search Heuristics Introduction Problem statementAssume a 25 ×25 two-dimensional maze. Each square in the maze has an (x,y) coordinate, with the bottom-left corner being (0,0) and the top-right corner being (24,24). Each position in the maze can be either empty or blocked. In addition, there are two “special” positions, the starting position and the exit position, both of which are selected randomly. The agent can only move up, down, left or right, but never diagonally. It also cannot enter blocked positions or move outside the maze. Its objective is to find a path from its starting position to the exit position, preferably the cheapest one. The cost of a path is the

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture