COMPUTER SCIENCE/DISCRETE MATH SEMINAR, II | |

Topic: | The Tic-Tac-Toe Theory |

Speaker: | Jozsef Beck |

Affiliation: | Rutgers University |

Date: | Tuesday, January 25 |

Time/Room: | 10:30am - 12:30pm/S-101 |

I want to show proofs for two things: (1) what kind of complicated structures can a player build in a "generalized Tic-Tac-Toe game", and (2) how to get the "exact solutions" of infinitely many games. I'll try to illustrate the ideas on simple examples.