First-Year Experience 2013-2014
Teacher-Advisor Program (TAP) Seminars
CS 032A ~ Puzzles, Games, and Algorithms
Instructor: Robert Snapp Associate Professor of Computer Science More . . .
What's the difference between a maze and a labyrinth? How many ways can a Rubik's cube be arranged? What is the real value of a Powerball ticket? How do computers solve puzzles and play games? Why are puzzles and games fun? This introductory computer science course will teach you, using mathematical puzzles and games and the algorithms that handle them. Learn how to solve anagrams, mazes, peg solitaire, the Tower of Hanoi, and Rubik's cube; how to play and analyze games of chance (like craps, poker, blackjack, and Powerball) and games of perfect information (like nim, mancala, hex, go, and chess). The course also includes an introduction to computer programming, and a field trip to the Great Vermont Corn Maze.
- Please also sign up for a lab session.
- Prerequisites: High school geometry and algebra 2
Requirements Satisfied: one Mathematical Sciences
Meets: LECTURE: MWF 10:40am-11:30am LAB: L01, W 1:55pm-3:10pm; or L02, R 10:00am-11:15am