--- title: Olympiad: thinking like a machine, Bebras puzzles ★★★ — the lesson's questions with trees and pragmatics · AI description: The 15 test and exam questions of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI course of Mova's primary school, each with its options, Mova's choice and the right answer, every sentence with its dependency tree and pragmatics. --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/) [home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [questions](https://md.mova.elamur.ai/free/en/corpora/questions/) / [AI](https://md.mova.elamur.ai/free/en/corpora/questions/ai/) / Olympiad: thinking like a machine, Beb… # Olympiad: thinking like a machine, Bebras puzzles ★★★ The 15 questions of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI course of Mova's primary school with their options, 86 sentences, every one parsed by Mova with its syntax tree and pragmatics. How the student did on them: [the lesson at school](https://md.mova.elamur.ai/free/en/school-run/ai/31-olympiad-thinking-like-a-machine/). - [t1](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t1/) — "bro's thinking of a number 1 to 32 and says i'll never get it in under a million guesses lol. how many yes/no qs do i actually need" — wrong ✗ · ★★★ - [t2](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t2/) — "my bot said strawberry has 2 r's. sus or nah?" — right ✓ · ★★★ - [t3](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t3/) — Robo faces east. It does: turn left, turn left, turn right. Which way does it face now? — wrong ✗ · ★★★ - [t4](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t4/) — "my mate's AI app keeps saying his husky's a wolf whenever it's in the snow lol". What would help fix the sorter most? — right ✓ · ★★★ - [t5](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t5/) — "Gran reckons a knockout for 16 teams takes forever, like a hundred matches". How many matches are really needed? — right ✓ · ★★★ - [t6](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t6/) — Ella says: "With 3 lamps you can only make 3 signals, one for each lamp." Is she right? — right ✓ · ★★★ - [t7](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t7/) — Odd one out: which instruction can a robot NOT follow exactly? — wrong ✗ · ★★★ - [t8](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t8/) — Ollie's chat log: after "I'm" came "starving" 5 times, "fine" 3 times, "bored" 2 times. Which word will a simple next-word guesser pick after "I'm"? — wrong ✗ · ★★★ - [t9](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t9/) — Dad's filter flags at 4 points or more (free 2, winner 2, urgent 1, click 1). "Urgent!! click here, it's free". Flagged? — right ✓ · ★★★ - [t10](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t10/) — Put the steps for teaching a picture sorter in a sensible order. — wrong ✗ · ★★★ - [t11](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/t11/) — The teacher says Robo had "one tiny bug": it drove the class cake off the table. How big was the problem really? — wrong ✗ · ★★★ - [e1](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e1/) — A participant conceals an integer between 1 and 64 inclusive and responds only "yes" or "no". Ascertain the least number of questions which is always sufficient. — wrong ✗ · exam - [e2](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e2/) — It is given that a knockout competition commences with 32 entrants and that each match eliminates precisely one entrant. Determine the number of matches required. — right ✓ · exam - [e3](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e3/) — Which of the following statements most accurately characterises the error of the picture sorter that classified a husky upon snow as a wolf? — wrong ✗ · exam - [e4](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e4/) — Identify the next term of the sequence 2, 5, 11, 23, ..., in which each term is formed by doubling the previous term and adding one. — wrong ✗ · exam - ← previous: [30. Who you are: what you will do with what you lear…](https://md.mova.elamur.ai/free/en/corpora/questions/ai/30-who-you-are-what-you-will-do/) - next →: [32. Olympiad: claims, clues and tricky messages ★★★](https://md.mova.elamur.ai/free/en/corpora/questions/ai/32-olympiad-claims-clues-and-tricky-messages/) - ↑ back to [AI](https://md.mova.elamur.ai/free/en/corpora/questions/ai/)