billproj - MINI PROJECTS IN THEORY 1. Dishwasher Game 2....

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MINI PROJECTS IN THEORY 1. Dishwasher Game 2. Reciprocals 3. Divisibility problem DISHWASHER GAME Given: Numbers a , b , a set of tiles, and a threshold t . 1. Players I and II take turns placing tiles on the a b grid. 2. Stop when a player cannot move. 3. If the number of open spaces is t then II wins, else I wins. WHAT TO ASK 1. Given a , b tiles and t , who wins? 2. Can approach mathematically and via computer program. 3. For a = 1 and b = n can probably be worked out mathematically. 4. Write a program to play this well (likely not perfect) using AI techniques. RECIPOCAL PROBLEM From MD Math Competition: (a) The equality 1 2 + 1 3 + 1 6 = 1 and 1 2 + 1 3 + 1 7 + 1 42 = 1 express 1 as the sum of three (respectively four) distinct positive integers. Find five positive integers a < b < c < d < e such that 1 a + 1 b + 1 c + 1 d + 1 e = 1 . (b) Prove that for any integer m 3 there exists m positive integers d 1 < d 2 < d m such that 1 d 1 + + 1 d m = 1 ....
View Full Document

This note was uploaded on 01/13/2012 for the course CMSC 297 taught by Professor Staff during the Fall '11 term at Maryland.

Page1 / 11

billproj - MINI PROJECTS IN THEORY 1. Dishwasher Game 2....

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online