Hi,
We'll be getting some new members today, so I'll basically be spending today
going over all of the concepts we've been using so far (basic CS theory, graph
searching, minimax, negamax, alpha-beta pruning, transposition tables). If you
have a good understanding of all of these concepts, feel free to skip this
meeting and we'll (finally) get back to working on the chess AI next week. If
you feel like you could use a refresher on some of these concepts, feel free to
come.
Thanks,
Matthew Page
