Warning
This page is located in archive. Go to the latest version of this course pages. Go the latest version of this page.

04 Adversarial I

How to search when someone is playing against us.

  1. Quizzes
  2. Recursive factorial implementation and analysis
  3. Learning about Reversi

Quiz I

Quiz II

Fibonacci Sequence

Program the recursive calculation of the Fibonacci sequence: $f(n) = f(n-1) + f(n-2)$.

Analyze the number of function calls and plunge depths.

Tree call:

Demo code:

Reversi: 2nd assigment

  • Download and get familiar with reversi (see here).
  • Launch the game
  • Create your own player
courses/be5b33kui/labs/weekly/week_04.txt · Last modified: 2019/03/22 16:04 by gamafili