Presentation on theme: "Problem #1 - Cryptoarithmetic Find a numeric substitution for each letter to make this a correct sum. The mapping from letters to numbers is 1-to- 1. (From."— Presentation transcript:
Problem #1 - Cryptoarithmetic Find a numeric substitution for each letter to make this a correct sum. The mapping from letters to numbers is 1-to- 1. (From Human Problem Solving, Newell and Simon) DONALD + GERALD ROBERT
Problem #2 – Logic Puzzle (From Dell Logic Puzzles, June 1996) B urt loves Indian food. Partly for this reason, he decided to spend his vacation in India. He visited five different Indian cities (Benares, Calcutta, Delhi, Madurai, and Trivandrum). In each city, Burt found a restaurant that prepared an exceptional version of a different Indian dish (aloo gobi, masala dosa, palak panir, sambir, and tandoori chicken). Can you find the order in which Burt visited the cities, and the exceptional dish he found in each?
Problem #2 (cont'd) In between Calcutta and the city in which Burt enjoyed the tandoori chicken (in one order or the other) Burt visited either one or two other cities. Immediately after visiting Delhi, Burt visited the city where he had the aloo gobi, from which he traveled directly to the city where he had an exquisite dish of palak panir. He visited Benares, then two more cities, and then arrived the place where he discovered the astounding sambar. While visiting Trivandrum, Burt had the best masala dosa he'd ever tasted.
Problem #3 – Mutilated Chess Brd. Con sider the following problem: You have a standard chess board (8 x 8 squares) except that two corners have been cut out, the upper left corner, and the bottom right corner, leaving 64 – 2 = 62 squares. You also have 31 dominoes where each domino covers exactly two squares of the chess board. Is it possible to cover the entire chess board with the dominoes? Each domino must cover two adjoining squares and all dominoes must be on the chess board.
Problem #3 (cont'd) * ***
Problem #4 - Mini-Sudoko Each puzzle consists of a 6x6 grid containing given clues in various places. The object is to fill all empty squares so that the numbers 1 to 6 appear exactly once in each row, column and box.