Professional Documents
Culture Documents
Waleed Amir 041
Waleed Amir 041
02-235171-041
Artificial
Intelligence
a) Define the concept of a Fully Observable environment.
In a fully observable environment, the state of a system is known at all times. Chess is a
good example. If you look at a chess board, all information required to make an optimal
decision is available. It doesn’t matter what happened in the past.
If taking an action results in a non-deterministic move (e.g., taking the action to move the
queen 3 spaces may end up moving it 2, 3, or 4 spaces, etc.), then the environment is
certainly stochastic.
But the state your agent receives after taking an action comes after your opponent makes
a move. So, for the environment to be deterministic, the opponent will have to always
respond to each of your agent's moves in exactly the same way, otherwise the next state is
scholastically determined.
Chess, itself, is a deterministic game, but, depending on how you define the environment,
may not be a deterministic MDP. If you can guarantee the opponent is deterministic, then
it would be deterministic. If you can't, though, then, really, the problem becomes a
Markov game, which is significantly more complex than a deterministic MDP.
But the state your agent receives after taking an action comes after your opponent makes
a move. So, for the environment to be deterministic, the opponent will have to always
respond to each of your agent's moves in exactly the same way, otherwise the next state is
scholastically determined.
Chess, itself, is a deterministic game, but, depending on how you define the environment,
may not be a deterministic MDP. If you can guarantee the opponent is deterministic, then
it would be deterministic. If you can't, though, then, really, the problem becomes a
Markov game, which is significantly more complex than a deterministic MDP.
c) How abstraction may help to represent a problem in AI? What is a good
abstraction? Explain with an example
Abstraction has proven to be a powerful tool for controlling the combinatorics of a
problem-solving search. Problem solving using abstract versions of tasks can provide
cost-effective search heuristics and evaluations for the original, or "full", tasks which
significantly reduce their computational complexity, and thus make large problems
tractable
Number 1 ring will be pick from second pole and place into the first pole
Number 2 ring will be pick from second pole and place into the third pole
Number 1 will be pick from first pole and place into the third pole [goal state]
B) Determine the state space that must be performed to get from the initial
state to the goal state.
Answer
State: larger ring cannot be place on smaller ring, from one pole ring can be shift
to the next two poles
Successor function: state that contain actions are pick and drop pole to pole
GOAL state: three ring all in third pole with the numbering of 1on top 2 on
second place and 3 on bottom.