Homework SourseQ Use truth tables or Boolean algebra to solve Knights and K
Q. Use truth tables or Boolean algebra to solve Knights and Knaves Problems
1. A says “The two of us are both knights” and B says “A is a knave”
2. A says “At least one of us is a knave” and B says nothing
Solution
1.
2.
| if A is | If B is | Truth values |
| Knight | Knight | A(T)B(F) |
| Knight | Knave | A(F)B(F) |
| Knave | Knight | A(F)B(T) |
| Knave | Knave | A(F)B(T) |
