MPDL
Computing Research Methods Multi-Perspective Digital Library

Guests are welcome to view our materials. To subscribe, edit, view raw markup, etc., you'll need to register for an account. Accounts are free (and will always be free) - your involvement helps us directly and indirectly (by demonstrating that our work matters to our funders...) StartingPoints has more info.
MPDL » IntroAIFall08

Possible Wumpus Worlds

HilaryHolz

  1. walk to the point shown in 7.4(a)
    1. percept at [1,1] is [ None, None, None, None, None ]
    2. move([1,1],[2,1])
    3. percept at [2,1] is [ None, Breeze, None, None, None ]
    4. l90
    5. l90
    6. move([2,1],[1,1])
    7. r90
    8. move([1,1],[1,2])
    9. percept at [1,2] is [ Stench, None, None, None, None ]

-- HilaryHolz - 20 Oct 2008

MichaelKhuong

Construct possible worlds

- Michael's Solutions after finding out what and how to do it after Hilary's example in class.

N = nothing.

W = Wumpus.

P = Pit.

Square (1,3) (2,2) (3,1) KB No pit in (2,2) No Wumpus in (1,3)
  N N N No Yes Yes
  W N N No Yes No
  N W N No Yes Yes
  N N W No Yes Yes
  P N N No Yes Yes
  PW N N No Yes No
  P W N No Yes Yes
  P N W No Yes Yes
  N P N No Yes Yes
  W P N No Yes No
  N PW N No Yes Yes
  N P W No Yes Yes
  N N P No No Yes
  W N P Yes No No
  N W P No No Yes
  N N PW No No Yes
  P P N No Yes Yes
  PW P N No Yes No
  P PW N No Yes Yes
  P P W No Yes Yes
  N P P No No Yes
  W P P No No No
  N PW P No No Yes
  N P PW No No Yes
  P N P No No Yes
  PW N P No No No
  P W P No No Yes
  P N PW No No Yes
  P P P No No Yes
  PW P P No No No
  P PW P No No Yes
  P P PW No No Yes

KavithaAshwin

Section 7.2:-

* Kavitha's Report on Wumpus World @ "Mutualdiscovery.WumpusWorld.ppt"

From To Status Information
[1,1] - [No,No,No,No,No] Safe(OK)
[1,1] [2,1] [No,B,No,No,No] P = { (3,1),(2,2) } ?
[2,1] [1,1] [No,No,No,No,No] Safe(OK)
[1,1] [1,2] [S,No,No,No,No] W = { (1,3),(2,2) } ?
      Processing Info using History: Safe=(2,2),P(3,1),W=(1,3)
[1,2] [2,2] [No,No,No,No,No] Safe(OK)
[2,2] [2,3] [S,B,G,No,No] W=(1,3),G=(2,3),P={(2,4),(3,3)} ?
      Processing: Kills Wumpus by shooting the arrow at (1,3) & Gets the Gold at (2,3)

Where: "[S=Stench,B=Breeze,G=Gold,P=Pit,W=Wumpus]"

-- KavithaAshwin - 21 Oct 2008

FaridNabavi

Possible Wumpus Worlds (SUSHANT KADADI)


People.Jyothirmai Vissapragada=

Introduction to Wumpus World A variety of "worlds" are being used as examples for Knowledge Representation, Reasoning, and Planning. Among them the Vacuum World, the Block World, and the Wumpus World. We will examine the Wumpus World and in this context introduce the Situation Calculus, the Frame Problem, and a variety of axioms. The Wumpus World was introduced by Genesereth, and is discussed in Russell-Norvig. The Wumpus World is a simple world (as is the Block World) for which to represent knowledge and to reason. It is a cave with a number of rooms, represented as a 4x4 square. The Wumpus world is a grid of squares surrounded by walls, where each square can contain agents and objects. The agent (you) always starts in the lower left corner, a square that will be labeled [1,1]. The agent's task is to find the gold, return to [1,1] and climb out of the cave. Report on Agent Syntax Lab - PART -A About Row-major order and Column-major Order Row- major order and Column-major order and two types techniques in arranging and storing arrays.Rows are identified by the first index of a two-dimensional array and columns by the second index.Column-major order is a similar method of flattening arrays onto linear memory, but the columns are listed in sequence.

When using row-major order, the difference between addresses of array cells in increasing rows is larger than addresses of cells in increasing columns. For example, consider this 2×3 array: 1 2 3 4 5 6

Column-major order is a similar method of flattening arrays onto linear memory, but the columns are listed in sequence. The programming languages Fortran and MATLAB use column-major ordering. The array

1 2 3 4 5 6 Treating a row-major array as a column-major array is the same as transposing it. Because performing a transpose requires data movement, and is quite difficult to do in-place for non-square matrices, such transpositions are rarely performed explicitly. For example, software libraries for linear algebra, such as the BLAS, typically provide options to specify that certain matrices are to be interpreted in transposed order to avoid the necessity of data movement. Column-major oder Column-major order is similar method of flattening arrays into linear memory, but the columns are listed in sequence. Let us consider the above example again 1 2 3 4 5 6 In a column-major order the tuples would be represented as : (1,1)(2,1)(1,2)(2,2)(1,3)(2,3) When stored in the memory, it would look like : 1 4 2 5 2 6 Order used by Python Python use row-major order. Knowing this would help a programmer to undestand the manner in which arrays are processed by the Python interpreter. Partially observable The wumpus is partially observable because it does not have the information of the full environment. The vacuum cannot tell if they are a wumpus near by because of it lack of information about the environment. Deterministic The agent is deterministic because it has the ability to call back on it pervious action and determine what the best logical steps to move on to not get eaten by the wumpus. Sequential The agent is sequential because all of it past and future decision could be effected if it does something wrong. So in essential, the agent has to think ahead of what are some of the possible move(s) that it can perform to accomplish its task and not get eaten by the wumpus. Static The environment that the agent has to travel to is static. Everything in the environment is already predefined when the program starts. Discrete The state of the environment is discrete because it has a finite number of moves before there no more moves left to be done. Single agent The agent is a single agent. The agent is the intelligent object that moves around the environment while the other stuffs in the environment is set to do a static set of tasks. Agent Syntax,Propositions,percepts and actions Agent in a particular location or square A[i,j] Wumpus in a particular location or square W[i,j] Pit in a particular location or square P[i,j] Gold particular location or square G[i,j] If a wumpus is killed in a particular location or square W[i,j] Percepts at a particular square [i,j] [Stench, Breeze, Glitter, Bump, Scream][i,j] If there is either a breeze or a stench from a particular square [i,j] then the agent perceives this from the adjacent square. That is [i+1,j],[i,j+1] or [i-1,j],[i,j-1] This is the case for a wumpus and a pit too. 7.1 Describe the wumpus world according to the properties of task environments listed in Chapter 2 From closer observation of the environment and the agent, we described the wumpus world as : • Partially observable - The agent does not have access to the complete state of the environment at each point in time. The agent knows the state of the current location. From the perceptions received at the current point, the agent can come to know the state of the neighboring locations only • We could not conclude whether the wumpus world is deterministic or stochastic. Further analysis showed that the environment being strategic might be a better option. But again, it depends upon the type of the agent and it's capabilities. • The wumpus world environment is sequential. It cannot be episodic because the actions at each state is not atomic. In the environment of our consideration, the perceptions or the experience of the agent at one particular state has it's impact on the subsequent states and actions.

7.2 Construct a set of possible wumpus worlds (32 of them possible) In the classs, we came up with 32 possible wumpus worlds. We used the following notation for each state • V for Visited • OK for no Wumpus or Pit • B for Breeze • S for Stench • P for Pit • W for Wumpus Available Knowledge Base = ((1,1) = V.OK) ∧ ((2,1) = B.V.OK) ∧ ((1,2) = S,V,OK) Given statements : • α = "There is no pit in [2,2]" • β = "There is a wumpus in [1,3]"

Model (1,1) (2,1) (3,1) (1,2) (2,2) (1,3) KB? α β

1 V,OK B,V,OK OK S,V,OK OK OK no T F

2 V,OK B,V,OK OK S,V,OK OK P no T F 3 V,OK B,V,OK OK S,V,OK OK W no T T 4 V,OK B,V,OK OK S,V,OK OK P,W no T T 5 V,OK B,V,OK OK S,V,OK P OK no F F 6 V,OK B,V,OK OK S,V,OK P P no F F 7 V,OK B,V,OK OK S,V,OK P W no F T 8 V,OK B,V,OK OK S,V,OK P P,W no F T 9 V,OK B,V,OK OK S,V,OK W OK no T F 10 V,OK B,V,OK OK S,V,OK W P no T F 11 V,OK B,V,OK OK S,V,OK P,W OK no F F 12 V,OK B,V,OK OK S,V,OK P,W P no F F 13 V,OK B,V,OK P S,V,OK OK OK no T F 14 V,OK B,V,OK P S,V,OK OK P no T F 15 V,OK B,V,OK P S,V,OK OK W yes T T 16 V,OK B,V,OK P S,V,OK OK P,W no T T 17 V,OK B,V,OK P S,V,OK P OK no F F 18 V,OK B,V,OK P S,V,OK P P no F F 19 V,OK B,V,OK P S,V,OK P W no F T 20 V,OK B,V,OK P S,V,OK P P,W no F T 21 V,OK B,V,OK P S,V,OK W OK no T F 22 V,OK B,V,OK P S,V,OK W P no T F 23 V,OK B,V,OK P S,V,OK P,W OK no F T 24 V,OK B,V,OK P S,V,OK P,W P no F T 25 V,OK B,V,OK W S,V,OK OK OK no T F 26 V,OK B,V,OK W S,V,OK OK P no T F 27 V,OK B,V,OK W S,V,OK P OK no F F 28 V,OK B,V,OK W S,V,OK P P no F F 29 V,OK B,V,OK P,W S,V,OK OK OK no T F 30 V,OK B,V,OK P,W S,V,OK OK P no T F 31 V,OK B,V,OK P,W S,V,OK P OK no F F 32 V,OK B,V,OK P,W S,V,OK P P no F F

DevasenaKopparty

Here are 32 possible wumpus worlds.

For each Wumpus Environment, we use the following check words representing each grid"

  • V for Visited
  • Safe for no Wumpus or Pit
  • B for Breeze
  • S for Stench
  • P for Pit
  • W for Wumpus

Available Knowledge Base = ((1,1) = V.OK) ∧ ((2,1) = B.V.OK) ∧ ((1,2) = S,V,OK)

Given statements :

No_pit = There is no pit in the grid [2,2]

Is_Wumpus= wumpus is in the grid [1,3]

Model (1,1) (2,1) (3,1) (1,2) (2,2) (1,3) KB? No_Pit Is_Wumpus
1 V,Safe B,V,Safe Safe S,V,Safe Safe Safe no T F
2 V,Safe B,V,Safe Safe S,V,Safe Safe P no T F
3 V,Safe B,V,Safe Safe S,V,Safe Safe W no T T
4 V,Safe B,V,Safe Safe S,V,Safe Safe P,W no T T
5 V,Safe B,V,Safe Safe S,V,Safe P Safe no F F
6 V,Safe B,V,Safe Safe S,V,Safe P P no F F
7 V,Safe B,V,Safe Safe S,V,Safe P W no F T
8 V,Safe B,V,Safe Safe S,V,Safe P P,W no F T
9 V,Safe B,V,Safe Safe S,V,Safe W Safe no T F
10 V,Safe B,V,Safe Safe S,V,Safe W P no T F
11 V,Safe B,V,Safe Safe S,V,Safe P,W Safe no F F
12 V,Safe B,V,Safe Safe S,V,Safe P,W P no F F
13 V,Safe B,V,Safe P S,V,Safe Safe Safe no T F
14 V,Safe B,V,Safe P S,V,Safe Safe P no T F
15 V,Safe B,V,Safe P S,V,Safe Safe W yes T T
16 V,Safe B,V,Safe P S,V,Safe Safe P,W no T T
17 V,Safe B,V,Safe P S,V,Safe P Safe no F F
18 V,Safe B,V,Safe P S,V,Safe P P no F F
19 V,Safe B,V,Safe P S,V,Safe P W no F T
20 V,Safe B,V,Safe P S,V,Safe P P,W no F T
21 V,Safe B,V,Safe P S,V,Safe W Safe no T F
22 V,Safe B,V,Safe P S,V,Safe W P no T F
23 V,Safe B,V,Safe P S,V,Safe P,W OK no F T
24 V,Safe B,V,Safe P S,V,Safe P,W P no F T
25 V,Safe B,V,Safe W S,V,Safe Safe Safe no T F
26 V,Safe B,V,Safe W S,V,Safe Safe P no T F
27 V,Safe B,V,Safe W S,V,Safe P OK no F F
28 V,Safe B,V,Safe W S,V,Safe P P no F F
29 V,Safe B,V,Safe P,W S,V,Safe Safe Safe no T F
30 V,Safe B,V,Safe P,W S,V,Safe Safe P no T F
31 V,Safe B,V,Safe P,W S,V,Safe P Safe no F F
32 V,Safe B,V,Safe P,W S,V,Safe P P no F F

People.Shravani Nimma

* possiblewumpusworld.doc: Shravani's Possible Wumpus World Models

People.Kiran Nanjundan

* PossibleWumpusWorld1.ppt: Possible Wumpus world models

People.Niraj Soni

* Wumpus_World.doc: Niraj's Possible Wumpus World

People.Indraneel Yadav

* Posiible_Wumpus_World_by_indraneel.doc: Possible Wumpus Worlds by Indraneel Yadav

ShikhaSharma

In the wumpus world agents

  • should collect gold from a rectangular world.
  • should avoid the pits, which are detectable by its cool breeze.
  • should kill the wumpus, which are detectable by its stench, by firing only 1 available arrow.

A simple knowledge based agent, accepts a precept and returns an action. Following possible Percepts are considered for

“V” for agent has visited the square
“OK" for safe square, i.e. no Wumpus or Pit in the square
“B” for Breeze i.e. There is a pit adjacent to the current square
"S" for Stench i.e. There is a wumpus adjacent to the current square
"P" for Pit in the square
"W" for Wumpus in the square

We start this problem after the agents third move with percept[Stench, None, None, None, None]. Till this stage agents has perceived nothing in [1,1], a breeze in [2,1] and a stench in [1,2].

Problem asks us to mark the worlds in which the KB is true and those in which following is true,

  • α2 = "There is no pit in [2,2]"
  • α3 = "There is a wumpus in [1,3]"

Since agent is now concerned with the contents of [3,1], [2,2] and [1,3]and we know that each of these can contain a pit and atmost one can contain a wumpus, we end up with 32 possible worlds.

WORLD (1,1) (2,1) (1,2) (3,1) (2,2) (1,3) α2 α3
1 V,OK B,V,OK S,V,OK OK OK OK T F
2 V,OK B,V,OK S,V,OK OK OK P T F
3 V,OK B,V,OK S,V,OK OK OK W T T
4 V,OK B,V,OK S,V,OK OK OK P,W T T
5 V,OK B,V,OK S,V,OK OK P OK F F
6 V,OK B,V,OK S,V,OK OK P P F F
7 V,OK B,V,OK S,V,OK OK P W F T
8 V,OK B,V,OK S,V,OK OK P P,W F T
9 V,OK B,V,OK S,V,OK OK W OK T F
10 V,OK B,V,OK S,V,OK OK W P T F
11 V,OK B,V,OK S,V,OK OK P,W OK F F
12 V,OK B,V,OK S,V,OK OK P, W P F F
13 V,OK B,V,OK S,V,OK P OK OK T F
14 V,OK B,V,OK S,V,OK P OK P T F
15 V,OK B,V,OK S,V,OK P OK W T T
16 V,OK B,V,OK S,V,OK P OK P,W T T
17 V,OK B,V,OK S,V,OK P P OK F F
18 V,OK B,V,OK S,V,OK P P P F F
19 V,OK B,V,OK S,V,OK P P W F T
20 V,OK B,V,OK S,V,OK P P P,W F T
21 V,OK B,V,OK S,V,OK P W OK T F
22 V,OK B,V,OK S,V,OK P W P T F
23 V,OK B,V,OK S,V,OK P P,W OK F T
24 V,OK B,V,OK S,V,OK P P,W P F T
25 V,OK B,V,OK S,V,OK W OK OK T F
26 V,OK B,V,OK S,V,OK W OK OK, P T F
27 V,OK B,V,OK S,V,OK W P OK F F
28 V,OK B,V,OK S,V,OK W P P F F
29 V,OK B,V,OK S,V,OK P,W OK OK T F
30 V,OK B,V,OK S,V,OK P,W OK P T F
31 V,OK B,V,OK S,V,OK P,W P OK F F
32 V,OK B,V,OK S,V,OK P,W P P F F

The only world in which the KB criterion is satisfied is world no. 15. In this world both α2 and α3 are true, also there is no pit in [2,2] and also there is a wumpus in [1,3].

HsienErnLan

* Mutualdiscovery.WumpusWorld.doc: Please see the attachment.

Paul Trinh

Karthik Sanyasi

TapasyaAgarwal

A simple knowledge based agent, accepts a precept and returns an action. Following possible Percepts are considered for

“V” for agent has visited the square

“OK" for safe square, i.e. no Wumpus or Pit in the square

“B” for Breeze i.e. There is a pit adjacent to the current square

"S" for Stench i.e. There is a wumpus adjacent to the current square

"P" for Pit in the square

"W" for Wumpus in the square

We start this problem after the agents third move with percept[Stench, None, None, None, None]. Till this stage agents has perceived nothing in [1,1], a breeze in [2,1] and a stench in [1,2].

Problem asks us to mark the worlds in which the KB is true and those in which following is true,

  • α2 = "There is no pit in [2,2]"
  • α3 = "There is a wumpus in [1,3]"

Since agent is now concerned with the contents of [3,1], [2,2] and [1,3]and we know that each of these can contain a pit and atmost one can contain a wumpus, we end up with 32 possible worlds.

WORLD (1,1) (2,1) (1,2) (3,1) (2,2) (1,3) α2 α3
1 V,OK B,V,OK S,V,OK OK OK OK T F
2 V,OK B,V,OK S,V,OK OK OK P T F
3 V,OK B,V,OK S,V,OK OK OK W T T
4 V,OK B,V,OK S,V,OK OK OK P,W T T
5 V,OK B,V,OK S,V,OK OK P OK F F
6 V,OK B,V,OK S,V,OK OK P P F F
7 V,OK B,V,OK S,V,OK OK P W F T
8 V,OK B,V,OK S,V,OK OK P P,W F T
9 V,OK B,V,OK S,V,OK OK W OK T F
10 V,OK B,V,OK S,V,OK OK W P T F
11 V,OK B,V,OK S,V,OK OK P,W OK F F
12 V,OK B,V,OK S,V,OK OK P, W P F F
13 V,OK B,V,OK S,V,OK P OK OK T F
14 V,OK B,V,OK S,V,OK P OK P T F
15 V,OK B,V,OK S,V,OK P OK W T T
16 V,OK B,V,OK S,V,OK P OK P,W T T
17 V,OK B,V,OK S,V,OK P P OK F F
18 V,OK B,V,OK S,V,OK P P P F F
19 V,OK B,V,OK S,V,OK P P W F T
20 V,OK B,V,OK S,V,OK P P P,W F T
21 V,OK B,V,OK S,V,OK P W OK T F
22 V,OK B,V,OK S,V,OK P W P T F
23 V,OK B,V,OK S,V,OK P P,W OK F T
24 V,OK B,V,OK S,V,OK P P,W P F T
25 V,OK B,V,OK S,V,OK W OK OK T F
26 V,OK B,V,OK S,V,OK W OK OK, P T F
27 V,OK B,V,OK S,V,OK W P OK F F
28 V,OK B,V,OK S,V,OK W P P F F
29 V,OK B,V,OK S,V,OK P,W OK OK T F
30 V,OK B,V,OK S,V,OK P,W OK P T F
31 V,OK B,V,OK S,V,OK P,W P OK F F
32 V,OK B,V,OK S,V,OK P,W P P F F

The only world in which the KB criterion is satisfied is world no. 15. In this world both α2 and α3 are true, also there is no pit in [2,2] and also there is a wumpus in [1,3].

SoyJoseph

Possible Wumpus Worlds

AnithaPadigapati

The wumpus world agents:

Should collect gold from a rectangular world. Avoid pits, which are detectable by its cool breeze. and should kill the wumpus.

A simple knowledge based agent, accepts a precept and returns an action. Following possible Percepts are considered for

“V” for agent has visited the square. “OK" for safe square, i.e. no Wumpus or Pit in the square. “B” for Breeze i.e. There is a pit adjacent to the current square. "S" for Stench i.e. There is a wumpus adjacent to the current square. "P" for Pit in the square. "W" for Wumpus in the square.

We start this problem after the agents third move with percept[Stench, None, None, None, None]. Till this stage agents has perceived nothing in [1,1], a breeze in [2,1] and a stench in [1,2].

AS agent is now concerned with the contents of [3,1], [2,2] and [1,3]and we know that each of these can contain a pit and atmost one can contain a wumpus, we end up with 32 possible worlds.

WORLD (1,1) (2,1) (1,2) (3,1) (2,2) (1,3) α2 α3
1 V,OK B,V,OK S,V,OK OK OK OK T F
2 V,OK B,V,OK S,V,OK OK OK P T F
3 V,OK B,V,OK S,V,OK OK OK W T T
4 V,OK B,V,OK S,V,OK OK OK P,W T T
5 V,OK B,V,OK S,V,OK OK P OK F F
6 V,OK B,V,OK S,V,OK OK P P F F
7 V,OK B,V,OK S,V,OK OK P W F T
8 V,OK B,V,OK S,V,OK OK P P,W F T
9 V,OK B,V,OK S,V,OK OK W OK T F
10 V,OK B,V,OK S,V,OK OK W P T F
11 V,OK B,V,OK S,V,OK OK P,W OK F F
12 V,OK B,V,OK S,V,OK OK P, W P F F
13 V,OK B,V,OK S,V,OK P OK OK T F
14 V,OK B,V,OK S,V,OK P OK P T F
15 V,OK B,V,OK S,V,OK P OK W T T
16 V,OK B,V,OK S,V,OK P OK P,W T T
17 V,OK B,V,OK S,V,OK P P OK F F
18 V,OK B,V,OK S,V,OK P P P F F
19 V,OK B,V,OK S,V,OK P P W F T
20 V,OK B,V,OK S,V,OK P P P,W F T
21 V,OK B,V,OK S,V,OK P W OK T F
22 V,OK B,V,OK S,V,OK P W P T F
23 V,OK B,V,OK S,V,OK P P,W OK F T
24 V,OK B,V,OK S,V,OK P P,W P F T
25 V,OK B,V,OK S,V,OK W OK OK T F
26 V,OK B,V,OK S,V,OK W OK OK, P T F
27 V,OK B,V,OK S,V,OK W P OK F F
28 V,OK B,V,OK S,V,OK W P P F F
29 V,OK B,V,OK S,V,OK P,W OK OK T F
30 V,OK B,V,OK S,V,OK P,W OK P T F
31 V,OK B,V,OK S,V,OK P,W P OK F F
32 V,OK B,V,OK S,V,OK P,W P P F F

Only world in which the KB criterion is satisfied is world no. 15. In this world both α2 and α3 are true, also there is no pit in [2,2] and also there is a wumpus in [1,3].


GopikrishnaNagaraja

PROPERTIES OF TASK ENVIRONMENTS

Observable Deterministic Episodic Static Discrete Agents
Partially Deterministic Sequential Static Discrete Single

Agent Percept Action Status
[1,1] Nothing Nothing OK
[2,1] Breeze l90,l90,Forward OK
[1,2] Stench Nothing OK
[2,2] NO Pit l90,l90,Forward Shoot OK

Agent Syntax,Propositions,percepts and actions

  • Agent in a particular location or square A[i,j]
  • Wumpus in a particular location or square W[i,j]
  • Pit in a particular location or square P[i,j]
  • Gold particular location or square G[i,j]
  • If a wumpus is killed in a particular location or square W[i,j]

I choose to explain in the way that concentrates on the actual agent movement from the start at square[1,1] to the square[1,3] where he kills the wumpus. The 32 possibility that are represented in a table in redundant information. what I mean to say is that focusing the path that the Agent takes will yield a more comprehensible explanation. the table format consumes time and slightly confuses the reader. One more point is that everyone ends up with the same table which will hinder the individuality of the concept behind it.


JasonSauer

Exercise 7.2

The agent has perceived nothing in [1,1], a breeze in [2,1], and a stench in [1,2]. The following are the 32 possible worlds:

[1,3] [2,2] [3,1] No pit in [2,2] No wumpus in [1,3] KB
N N N Y Y N
W N N Y N N
N W N Y Y N
N N W Y Y N
P N N Y Y N
PW N N Y N N
P W N Y Y N
P N W Y Y N
N P N Y Y N
W P N Y N N
N PW N Y Y N
N P W Y Y N
N N P N Y N
W N P Y Y Y
N W P N Y N
N N PW N Y N
P P N Y Y N
PW P N Y N N
P PW N Y Y N
P P W Y Y N
N P P N Y N
W P P N N N
N PW P N Y N
N P PW N Y N
P N P N Y N
PW N P N N N
P W P N Y N
P N PW N Y N
P P P N Y N
PW P P N N N
P PW P N Y N
P P PW N Y N

Anup Mohan

Since agent is now concerned with the contents of [3,1], [2,2] and [1,3]and we know that each of these can contain a pit and atmost one can contain a wumpus, we end up with 32 possible worlds.

WORLD (1,1) (2,1) (1,2) (3,1) (2,2) (1,3) α2 α3
1 V,OK B,V,OK S,V,OK OK OK OK T F
2 V,OK B,V,OK S,V,OK OK OK P T F
3 V,OK B,V,OK S,V,OK OK OK W T T
4 V,OK B,V,OK S,V,OK OK OK P,W T T
5 V,OK B,V,OK S,V,OK OK P OK F F
6 V,OK B,V,OK S,V,OK OK P P F F
7 V,OK B,V,OK S,V,OK OK P W F T
8 V,OK B,V,OK S,V,OK OK P P,W F T
9 V,OK B,V,OK S,V,OK OK W OK T F
10 V,OK B,V,OK S,V,OK OK W P T F
11 V,OK B,V,OK S,V,OK OK P,W OK F F
12 V,OK B,V,OK S,V,OK OK P, W P F F
13 V,OK B,V,OK S,V,OK P OK OK T F
14 V,OK B,V,OK S,V,OK P OK P T F
15 V,OK B,V,OK S,V,OK P OK W T T
16 V,OK B,V,OK S,V,OK P OK P,W T T
17 V,OK B,V,OK S,V,OK P P OK F F
18 V,OK B,V,OK S,V,OK P P P F F
19 V,OK B,V,OK S,V,OK P P W F T
20 V,OK B,V,OK S,V,OK P P P,W F T
21 V,OK B,V,OK S,V,OK P W OK T F
22 V,OK B,V,OK S,V,OK P W P T F
23 V,OK B,V,OK S,V,OK P P,W OK F T
24 V,OK B,V,OK S,V,OK P P,W P F T
25 V,OK B,V,OK S,V,OK W OK OK T F
26 V,OK B,V,OK S,V,OK W OK OK, P T F
27 V,OK B,V,OK S,V,OK W P OK F F
28 V,OK B,V,OK S,V,OK W P P F F
29 V,OK B,V,OK S,V,OK P,W OK OK T F
30 V,OK B,V,OK S,V,OK P,W OK P T F
31 V,OK B,V,OK S,V,OK P,W P OK F F
32 V,OK B,V,OK S,V,OK P,W P P F F

The only world in which the KB criterion is satisfied is world no. 15. In this world both α2 and α3 are true, also there is no pit in [2,2] and also there is a wumpus in [1,3].


MutualDiscoveryForm
Mutualdiscdev.CSUEBFall08Courses: IntroAIFall08
  Attachment Action Size Date Who Comment
doc Posiible_Wumpus_World_by_indraneel.doc props, move 226.0 K 10 Nov 2008 - 18:19 IndraneelYadav  
doc PossibleWumpusWorld.doc props, move 79.5 K 10 Nov 2008 - 16:16 KarthikSanyasi  
doc PossibleWumpusWorld1.doc props, move 107.5 K 10 Nov 2008 - 16:28 KarthikSanyasi  
ppt Possible_Wumpus_World1.ppt props, move 459.0 K 08 Nov 2008 - 18:15 KiranNanjundan  
ppt Possible_Wumpus_Worlds.ppt props, move 148.0 K 08 Nov 2008 - 11:23 SushantKadadi Possible Wumpus World Models
doc Possible_wumpus_worlds.doc props, move 55.5 K 09 Nov 2008 - 19:37 PaulTrinh  
doc WumpusWorld.doc props, move 62.0 K 09 Nov 2008 - 15:33 HsienErnLan  
ppt WumpusWorld.ppt props, move 236.0 K 21 Oct 2008 - 16:15 KavithaAshwin  
doc Wumpus_World.doc props, move 117.0 K 10 Nov 2008 - 08:33 NirajSoni  
doc possiblewumpusworld.doc props, move 201.0 K 08 Nov 2008 - 16:52 ShravaniNimma  
r29 - 12 May 2009 - 14:43:47 - HilaryHolz
Guests are welcome to view our materials. To subscribe, edit, view raw markup, etc., you'll need to register for an account. Accounts are free (and will always be free) - your involvement helps us directly and indirectly (by demonstrating that our work matters to our funders...) StartingPoints has more info.
This site is powered by the TWiki collaboration platformCopyright 1999-2009 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding Ahatwiki? Send feedback Syndicate this site RSSATOM