---
title: It is given that a knockout competition commences with 32 entrants a… — Olympiad: thinking like a machine, Beb… · tree and pragmatics
description: 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. Exam question 2 of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI course of Mova's primary school, with the 
---

<!-- md -->
[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/e2/)

<!-- crumbs -->
[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…](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/) / e2

# Exam question 2 · Olympiad: thinking like a machine, Bebras puzzles ★★★

<!-- .ven lang=en -->
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.

<!-- .vintro -->
**Mova's choice:** option 1 · **The right answer:** option 1 · right ✓ · **Who acts:** knockout competition, match, you · **What happens:** give, commence, eliminate, determine, require · **To what, where:** It, one entrant, number, matches

<!-- .vabout -->
This is exam question 2 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](https://md.mova.elamur.ai/free/en/school-run/ai/31-olympiad-thinking-like-a-machine/#e2).

## The question {#question}

<!-- .note -->
*Sentence 1:* It is given that a knockout competition commences with 32 entrants and that each match eliminates precisely one entrant.

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e2:1
# text = It is given that a knockout competition commences with 32 entrants and that each match eliminates precisely one entrant.
1	It	it	PRON	PRP	Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs	3	nsubj:pass	_	_
2	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	aux:pass	_	_
3	given	give	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	0	root	_	_
4	that	that	SCONJ	IN	_	8	mark	_	_
5	a	a	DET	DT	Definite=Ind|PronType=Art	7	det	_	_
6	knockout	knockout	NOUN	NN	Number=Sing	7	compound	_	_
7	competition	competition	NOUN	NN	Number=Sing	8	nsubj	_	_
8	commences	commence	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	advcl	_	_
9	with	with	ADP	IN	_	11	case	_	_
10	32	32	NUM	CD	NumForm=Digit|NumType=Card	11	nummod	_	_
11	entrants	entrant	NOUN	NNS	Number=Plur	8	obl	_	_
12	and	and	CCONJ	CC	_	16	cc	_	_
13	that	that	SCONJ	IN	_	16	mark	_	_
14	each	each	DET	DT	PronType=Tot	15	det	_	_
15	match	match	NOUN	NN	Number=Sing	16	nsubj	_	_
16	eliminates	eliminate	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	8	conj	_	_
17	precisely	precisely	ADV	RB	_	18	advmod	_	_
18	one	one	NUM	CD	NumForm=Word|NumType=Card	19	nummod	_	_
19	entrant	entrant	NOUN	NN	Number=Sing	16	obj	_	SpaceAfter=No
20	.	.	PUNCT	.	_	3	punct	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **give** | present · passive |  | It |  |  |  |  | vn give-13.1-1 «NP V NP»: subject=Theme |
| 2 | **commence** | present | a knockout competition |  |  |  |  | with 32 entrants | vn begin-55.1-1-1 «NP V PP.subeventuality»: agent=Eventuality with entrant=Subeventuality |
| 3 | **eliminate** | present | each match | one entrant |  |  |  |  | vn murder-42.1 «NP V NP»: agent=Agent entrant=Patient |

<!-- .note -->
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.

<!-- .note -->
*Sentence 2:* Determine the number of matches required.

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e2:2
# text = Determine the number of matches required.
1	Determine	determine	VERB	VB	Mood=Imp|VerbForm=Fin	0	root	_	_
2	the	the	DET	DT	Definite=Def|PronType=Art	3	det	_	_
3	number	number	NOUN	NN	Number=Sing	1	obj	_	_
4	of	of	ADP	IN	_	5	case	_	_
5	matches	match	NOUN	NNS	Number=Plur	3	nmod	_	_
6	required	require	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	5	acl	_	SpaceAfter=No
7	.	.	PUNCT	.	_	1	punct	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **determine** | imperative | you *not said here* | the number of matches |  |  |  |  | vn discover-84 «NP V NP»: agent=Agent number=Topic |
| 2 | **require** | participle |  | matches *not said here* |  |  |  |  | vn require-103-1 «NP V NP S\_INF»: agent=Theme |

## The options {#options}

### Option 1 · ← Mova's choice · ✓ the right answer {#o1}

<!-- .ven lang=en -->
31

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e2:o1:1
# text = 31
1	31	31	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

### Option 2 {#o2}

<!-- .ven lang=en -->
64

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e2:o2:1
# text = 64
1	64	64	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

### Option 3 {#o3}

<!-- .ven lang=en -->
16

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e2:o3:1
# text = 16
1	16	16	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

### Option 4 {#o4}

<!-- .ven lang=en -->
32

```conllu
# sent_id = question:ai:31-olympiad-thinking-like-a-machine:e2:o4:1
# text = 32
1	32	32	NUM	CD	NumForm=Digit|NumType=Card	0	root	_	_
```

<!-- .note -->
The frames reader finds no event or fact in this sentence.

<!-- div src -->

**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.

<!-- /div -->

<!-- pn -->
- ← previous: [Olympiad: thinking like a machine, Beb…, exam 1](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e1/)
- next →: [Olympiad: thinking like a machine, Beb…, exam 3](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/e3/)
- ↑ back to [Olympiad: thinking like a machine, Bebras puzzles ★★★](https://md.mova.elamur.ai/free/en/corpora/questions/ai/31-olympiad-thinking-like-a-machine/)