The Wumpus World is an example for Knowledge Representation, Reasoning, and Planning- in which an agent had to explore a cave made up from a series of interconnected rooms. In one of the rooms in the cave, there was a Wumpus which would kill the agent if it entered that room. Some rooms contained pits, and the agent would die if it entered any of those rooms too. The agent had one arrow with which it could kill the Wumpus. The goal was to locate the gold that was hidden somewhere in the cave and return to the start without getting killed.
http://www.cis.temple.edu/~giorgio/cis587/readings/wumpus.shtml
There is exactly one Wumpus.
Hence W1,1 ∨ W1,2 ∨ ... W4,3 ∨ W4,4
One way to say that there is at most one wumpus is that for any 2 squares, one of them must be wumpus-free. With n squares, we get n(n-1)/2 sentences such as ¬W1,1 ∨ ¬W1,2 .For a 4*4 world we begin with a total of 155 sentences containing 64 distinct symbols.
I'm not able to understand how we get n(n-1)/2 sentences. And also- how do we know that in a 4*4 world we have a total of 155 sentences? Can someone please explain this concept to me. Thanks.