This first batch of test cases is for WalkSAT alone: simply see if these, added to the knowledge base representing the rules of the game, are satisfiable.  If they aren't, your program should say so; if they are, it should print a satisfying assignment.  Turn in your output on these test cases with your code (you may encode them for input, even hardcoding them in, as you like):

~B11, ~S11, ~B12, ~S12, B13, S13, W23
Yes
~B11, ~S11, ~B12, ~S12, B13, S13, ~W23
Yes
~B11, ~S11, ~B12, ~S12, B13, S13, ~P14
Yes
~B11, ~S11, ~B12, ~S12, B13, S13, P14
Yes
~B11, ~S11, ~B12, ~S12, B13, S13, S22, ~B22, W23
Yes
~B11, ~S11, ~B12, ~S12, B13, S13, S22, ~B22, ~W23
No
~B11, ~S11, ~B12, ~S12, B13, S13, S22, ~B22, ~P14
No
~B11, ~S11, ~B12, ~S12, B13, S13, S22, ~B22, P14
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, P24
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, ~P24
No
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, P33
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, ~P33
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, ~B22, ~S22, B32, ~S32, P42
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, ~B22, ~S22, B32, ~S32, ~P42
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, ~B22, ~S22, B32, ~S32, P33
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, ~B22, ~S22, B32, ~S32, ~P33
Yes
~B11, ~S11, ~B12, ~S12, ~B13, ~S13, B14, ~S14, B23, ~S23, ~B22, ~S22, B32, ~S32, ~P33
Yes

WumpusWalk tests
For the next batch, in each set the first line is the observations to be added to the knowledge base, the second is the query, and the third is whether the query was entailed by the knowledge base.  You don't need to turn in these tests.

~B11,~S11
OK12
Yes

~B11
OK12
No

~B14,B23,S23,~B21,S32
OK13
Yes

Wumpus agent test (O=empty, G=gold, P=pit, W=wumpus).  You should print out the actions of your Wumpus agent on the given board. Assume you start in the lower left.
OOOG
OOOP
OWPO
OOPO