//SLMC Problem of the Week # 2 – English
SLMC Problem of the Week # 2 – English2018-09-20T19:34:35+00:00

Home Forums Problem of the Week SLMC Problem of the Week # 2 – English

Viewing 4 posts - 1 through 4 (of 4 total)
  • Author
    Posts
  • Raveen ErandaRaveen Eranda
    Keymaster
    Post count: 2
    lasitha nirlasitha nir
    Participant
    Post count: 1

    Because the camel only moves in either white or black squres the camel cant have a camels tour from a1 to b1.but if theres a tour it implies that however camel was able to change the colour of the squres that he moves, which means he can perform disorted moves.because he can perform disorted moves he can do a camels tour from any squre to any square

    Akila WickramagamageAkila Wickramagamage
    Participant
    Post count: 1

    The camel can only move in the same colored squares I.e. it can only move in white or it can only move in black.A1 & B1 are different colour squares so the camel can never move from one to the other. Whereas B2 is the same color as A1 so it can follow some path and move to that square. However if the camel was somehow able to move from A1 to B1 this would imply that it can move to similar colour squares as well. So it can move from any square to any other squares. So both answer B&C are correct.

    • This reply was modified 3 months, 4 weeks ago by Akila Wickramagamage Akila Wickramagamage. Reason: I forgot to input my answer
    Thejani GamageThejani Gamage
    Participant
    Post count: 1

    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

Viewing 4 posts - 1 through 4 (of 4 total)

You must be logged in to reply to this topic.