CSCI 4321 Games & Computation

This course provides an overview of the complexity of games and puzzles. The topics include hardness results and complexity classes with constraint logic reductions, combinatorial game theory, and standard game theory. The final report for each group summarizes weekly objectives, complexity, programming assignments, CGT endgame positions, and other related work. Additional topics may include some basic ML techniques, and elements of game design.

Credits

3

Prerequisite

CSCI 3333.

Schedule Type

Lecture

Grading Basis

Standard Letter (A-F)

Administrative Unit

Department of Computer Science

Offered

As scheduled