Exam question 1 · Olympiad: thinking like a machine, Bebras puzzles ★★★
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.
Mova's choice: option 1 · The right answer: option 3 · wrong ✗ · Who acts: participant, you, questions · What happens: conceal, respond, ascertain, be · To what, where: integer, 1, no, least number
This is exam question 1 of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI course of Mova's primary school, asked in stiff, formal language. The page gives the question's syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause, then the 4 options as the student saw them, each with its tree and pragmatics. Every text is parsed by Mova itself. How the student answered it, with the score of every option and why: the test at school.
The question
Sentence 1: A participant conceals an integer between 1 and 64 inclusive and responds only "yes" or "no".
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | A | a | DET | Definite=Ind PronType=Art | 2 participant | det |
| 2 | participant | participant | NOUN | Number=Sing | 3 conceals | nsubj |
| 3 | conceals | conceal | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | root | root |
| 4 | an | a | DET | Definite=Ind PronType=Art | 5 integer | det |
| 5 | integer | integer | NOUN | Number=Sing | 3 conceals | obj |
| 6 | between | between | ADP | _ | 7 1 | case |
| 7 | 1 | 1 | NUM | NumForm=Digit NumType=Card | 5 integer | nmod |
| 8 | and | and | CCONJ | _ | 9 64 | cc |
| 9 | 64 | 64 | NUM | NumForm=Digit NumType=Card | 7 1 | conj |
| 10 | inclusive | inclusive | ADJ | Degree=Pos | 3 conceals | xcomp |
| 11 | and | and | CCONJ | _ | 12 responds | cc |
| 12 | responds | respond | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 conceals | conj |
| 13 | only | only | ADV | _ | 19 no | advmod |
| 14 | " | " | PUNCT | _ | 19 no | punct |
| 15 | yes | yes | INTJ | Polarity=Pos | 19 no | discourse |
| 16 | " | " | PUNCT | _ | 15 yes | punct |
| 17 | or | or | CCONJ | _ | 19 no | cc |
| 18 | " | " | PUNCT | _ | 19 no | punct |
| 19 | no | no | NOUN | Number=Sing | 12 responds | obl |
| 20 | " | " | PUNCT | _ | 19 no | punct |
| 21 | . | . | PUNCT | _ | 3 conceals | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | conceal | present | a participant | a integer | 1 | inclusive property | vn concealment-16 «NP V NP PP.location»: agent=Agent integer=Patient between 1=Location | ||
| 2 | respond speech: other | present | a participant not said here | no | vn respond-113 «NP V»: agent=Agent |
One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree.
Sentence 2: Ascertain the least number of questions which is always sufficient.
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Ascertain | ascertain | VERB | Mood=Imp VerbForm=Fin | root | root |
| 2 | the | the | DET | Definite=Def PronType=Art | 4 number | det |
| 3 | least | least | ADJ | Degree=Sup | 4 number | amod |
| 4 | number | number | NOUN | Number=Sing | 1 Ascertain | obj |
| 5 | of | of | ADP | _ | 6 questions | case |
| 6 | questions | question | NOUN | Number=Plur | 4 number | nmod |
| 7 | which | which | PRON | PronType=Rel | 10 sufficient | nsubj |
| 8 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 10 sufficient | cop |
| 9 | always | always | ADV | PronType=Tot | 10 sufficient | advmod |
| 10 | sufficient | sufficient | ADJ | Degree=Pos | 6 questions | acl:relcl |
| 11 | . | . | PUNCT | _ | 1 Ascertain | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | ascertain | imperative | you not said here | the least number of questions | vn discover-84 «NP V NP»: agent=Agent number=Topic | ||||
| 2 | is | present | questions | always, sufficient property | tree rules |
The options
Option 1 · ← Mova's choice
63
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 63 | 63 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 2
8
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 8 | 8 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 3 · ✓ the right answer
6
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 6 | 6 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
32
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 32 | 32 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Text: the tests of Mova's primary school, written for Mova (world/data/school/), as the course runner gave them to the student. Trees: Mova's own parse — the en model on the CPU, when the site is built — not checked by a teacher; they may be wrong. Frames: Mova's frames reader (prag), each text read on its own. Elamur Cosmic License.
This page in Markdown → https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e1/