04 Adversarial II

How to prune the tree to see better.

Learning outcomes

After this practice session, the student

  • understands the principle of Minimax algorithm and is able to simulate its run on small tasks;
  • understands $\alpha-\beta$ pruning and is able to simulate its run on small tasks, i.e., can decide which branches of the game tree do not have to be searched; can set such expansion order of individual branches to maximize (or minimize) the number of pruned branches;
  • understands the specifications of the second mandatory task, Reversi.

Program

  • Discussion of the last bonus quiz (heuristics)
  • Minimax algorithm rehearsal
  • $\alpha-\beta$ pruning in action
  • Reversi assignment Q/A

Exercise / Solving together

Bonus quiz

  • $\alpha,\beta$ quiz on optimal ordering of notes
  • 0.5 points
  • submit your solution to BRUTE lab04quiz, deadline in BRUTE
  • format: text file, photo of your solution on paper, pdf - what is convenient for you
  • solution will be discussed on the next lab
  • Solve and upload the right version according to the first character of your family name:
    • family name starting from A to L: version A
    • family name starting from M to Z: version B.

Homework

  • Submit your solution of bonus quiz to BRUTE, task lab04quiz.
  • Finish mandatory task 03-search.
  • Start working on the second mandatory task 05-reversi.
courses/be5b33kui/labs/weekly/week_04.txt · Last modified: 2026/03/04 08:17 by xposik