Question

Previous bonus - Next bonus
The minimax algorithm is often impractical for types of these data structures with large branching factors. For 10 points each:
[10e] Name these structures often used to represent all possible states of sequential games. These acyclic graphs contain root and leaf nodes.
ANSWER: trees [accept binary trees or game trees or decision trees]
[10m] The minimax algorithm performs this type of search on game trees, which involves backtracking while traversing every branch as far as possible, unlike an alphabetically earlier type of search.
ANSWER: depth-first search [or DFS] (The alternative is breadth-first search.)
[10h] Implementation of minimax is improved by an algorithm named for both this technique and two adjacent Greek letters. This technique removes undesirable subtrees from consideration.
ANSWER: pruning [accept alpha–beta pruning; accept word forms like prunes]
<Science - Other Science - Computer Science>

Back to bonuses

Data

TeamOpponentPart 1Part 2Part 3Total
Audrain County ATLambert A100010
BelmontAdlai E. Stevenson A10101030
Hunter ADetroit Catholic Central A1001020
Innovation Academy AUni of Illinois Laboratory100010
LexingtonStrake Jesuit A1001020
LindberghWestwood10101030
Montgomery Blair ANorthview10101030
NorthmontJohns Creek10101030
Richard MontgomeryEastchester10101030
Strake Jesuit BFremd1010020
Thomas Jefferson AAlabama Cyber Tech10101030
Walter Payton AHinsdale Central A1010020

Summary

TournamentEditionExact Match?HeardPPBEasy %Medium %Hard %
2025 PACE NSC06/07/2025Y1223.33100%67%67%