CMPT 317
Fall 2020
Introduction to Artifificial Intelligence
计算机网课作业代写 Using all of the information above, formalize the problem of determining a complete possible configuration of robot master weaknesses as a CSP.
Assignment 5
Constraint Satisfaction Problems
Question 1 (10 points):
Purpose: To formalize a problem description a CSP
AIMA Chapter(s): 6.1
Overview 计算机网课作业代写
Mega Man is a video game series where the player (in the role of a robot hero named Mega Man) can challenge one of several evil robot masters in any order. When Mega Man defeats a robot master, he obtains that master’s unique weapon. Each such weapon is especially eective against one of the other robot masters in the game. Figuring out the weakness of each robot master can make life a lot easier for Mega Man!
For this question, your task is to formalize the problem of determining each robot master’s weakness as a Constraint Satisfaction Problem. This means you need to exhaustively describe the:
- Variables in the CSP problem
- Domains of each variable
- Set of constraints for the problem
- Group your constraints into categories and describe each category informally so they are easier to read
- List which variables are involved in each constraint
- Exhaustively list the tuples of allowed values for the variables in the constraint
Problem Details 计算机网课作业代写
This section will describe the rules of the problem environment in greater detail.
We will concern ourselves with the game Mega Man 2. The following is a list of the game’s 8 robot masters along with the weapon gained from defeating each one.
- Bubble Man: grants the bubble lead
- Air Man: grants the air shooter
- Quick Man: grants the quick boomerang
- Heat Man: grants the atomic re
- Wood Man: grants the leaf shield
- Metal Man: grants the metal blade
- Flash Man: grants the time stopper
- Crash Man: grants the crash bomber
The following rules apply to the weaknesses of the robot masters:
- Each robot master has exactly one weakness
- Each weapon is the weakness of only one robot master
- A robot master is never weak against its own weapon
- The weaknesses are never paired. That is to say, if robot master A grants the correct weapon to use against robot master B, then robot master B’s weapon will NOT be the weakness of robot master A
Finally, you are told the following guaranteed facts about the weaknesses:
- Bubble Man’s weakness is the metal blade
- Wood Man’s weakness is the atomic re
- Flash Man’s weakness is the crash bomber
Using all of the information above, formalize the problem of determining a complete possible configuration of robot master weaknesses as a CSP.
What to Hand In 计算机网课作业代写
Hand in your CSP speci cation in a single document called a5q1.pdf.
Evaluation
- 1 mark for listing CSP variables
- 3 marks for listing the domain of each variable
- 3 marks for describing the constraints and the variables involved in each constraint
- 3 marks for listing the tuples of allowed values for each constraint
更多代写：北美网课代修价格 托福在家考机经 代写assignment收费 代写英文essay 北美论文润色 新加坡计算机代写
合作平台：essay代写 论文代写 写手招聘 英国留学生代写