Home › Forums › Problem of the Week › SLMC Problem of the Week # 2 – English › Reply To: SLMC Problem of the Week # 2 – English

It is true that since b2 is the same color as a1 the camel can go from a1 to b2. One such possible path is a1,b4,e3,b2. But a camel’s tour is when he visits EVERY square of the board only once. Since a camel who starts moving from a1, can only move to black squares, he cannot visit white squares. Hence he cannot visit all the squares. So a Camel’s TOUR from a1 to b2 does not exist. So statement 2 is INCORRECT.

Statement 3 states that if there is a camel tour from a1 to b1, then there is a camel’s tour from any square to any other square. This is a conditional statement.

Let P denote the statement, there is a camel tour from a1 to b1.

Let Q denote the statement,here is a camel’s tour from any square to any other square.

Then P implies Q is a conditional Statement. When P is false, regardless of whether Q is true or false, Conditional Statement is true. (This is valid for any Conditional Statement.)

We know the statement, there is a camel tour from a1 to b1, is false.

Therefore, statement 3 is true.

So the answer is C