Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Problem 2: Describe reasonable heuristic algorithms or rules for the follow- ing problems. For this problem, you do not need to give full implementation details:

Problem 2: Describe reasonable heuristic algorithms or rules for the follow- ing problems. For this problem, you do not need to give full implementation details: it is enough to describe the main idea behind the algorithm or rule in 1-2 sentences. Keep in mind that it is ok if a heuristic sometimes fails to find the best answer. 2. PacMan is a popular video game in which you control a character in a maze. The maze contains golden tokens at various locations, and your goal is to `eat' as many of these tokens as you can (in other words, move the PacMan character over the tokens). The maze also contains `ghosts', who move around the maze and try to eat PacMan. If a ghost collides with PacMan, then the game is over. Design a reasonable heuristic algorithm for maximizing the number of tokens collected. (See https://www.google.com/#q=pacman&clb=clb to play.)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database And Expert Systems Applications 33rd International Conference Dexa 2022 Vienna Austria August 22 24 2022 Proceedings Part 1 Lncs 13426

Authors: Christine Strauss ,Alfredo Cuzzocrea ,Gabriele Kotsis ,A Min Tjoa ,Ismail Khalil

1st Edition

3031124227, 978-3031124228

More Books

Students also viewed these Databases questions