The Angel Problem John H. Conway Presented by Aaron Nickel and Carson English.

Slides:

Advertisements

Similar presentations

How to Play Checkers This presentation is a tutorial on how to play one of the oldest and most popular games in history. Presented by: Joshua Cox Project.

Advertisements

Informed Search Methods How can we improve searching strategy by using intelligence? Map example: Heuristic: Expand those nodes closest in “as the crow.

IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.

Simeon Judah Reuben Ephraim Manasseh East Manasseh Asher Naphtali Issachar Zebulun Gad Dan Benjamin Edom Moab Ammon Aram R ECLAIM THE P ROMISED L AND BLUE.

EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium

Presented by: Zhenhuan Sui Nov. 24 th, Game Theory: applied mathematics in social sciences, especially economics. It is to mathematically find behaviors.

The Pigeonhole Principle

Ch. 10: What is a number?. MAIN DEFINITION OF THE COURSE: A symmetry of an object (in the plane or space) means a rigid motion (of the plane or space)

Games as Emergent Systems first schema on “rules”.

The Angel Wins!! SASMS, Nov 13, 2006 David Rhee. 1. Conway’s Angel Problem An angel of power p and a devil plays a game on a infinitely big chessboard.

Industrial Organization - Matilde Machado Tacit Collusion Tacit Collusion Matilde Machado.

Table of Contents Why Play Chess? Setting Up the Board Get to Know the Pieces Check and Checkmate What the Chess Pieces Are Worth Opening Goals Endgame.

Module 3 Chess 101 Strategy Strategy refers to an overall plan to achieve a goal In every game you play your goal should be to checkmate your opponent,

An Algorithm for Probabilistic Alternating Simulation University of New South Wales University of Luxembourg Authors: Chenyi Zhang Jun Pang Presentation:

Place captured red pieces here Place captured yellow pieces here To use as Kings Rules New Game Exit Left mouse click on piece – drag to desired location.

Progressively Finite Games

An Introduction to Game Theory Part I: Strategic Games

McGraw-Hill Ryerson Copyright © 2011 McGraw-Hill Ryerson Limited. Adapted by Peter Au, George Brown College.

Time to Teach Presents Year 7 (National Numeracy Strategy) (Based on DFEE Sample Lessons)

NYOUT A game from South Korea. Set up 2 to 4 players The circle and the cross are composed of circles that act as playing spaces. The center circle and.

CompSci Recursion & Minimax Playing Against the Computer Recursion & the Minimax Algorithm Key to Acing Computer Science If you understand everything,

A Game Of Strategy … Or Luck? Serene Li Hui Heng Xiaojun Jiang Cheewei Ng Li Xue Alison Then Team 5, MS&E220 Autumn 2008.

CHECKMATE! A Brief Introduction to Game Theory Dan Garcia UC Berkeley The World Kasparov.

Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.

Aswath Damodaran1 Session 9: Terminal Value. Aswath Damodaran2 Getting Closure in Valuation A publicly traded firm potentially has an infinite life. The.

How to play Chess.

Definitions from the Text, sections 1.1 – 1.4

Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.

A Beginners Guide. The Pieces Chess consists of Sixteen pieces eight Pawns two Rooks two Knights two bishops one Queen and one king this guide will show.

SIMPLE MACHINES.

Objective How to solve Integer problems

Midpoint and Distance Formulas Section 1.3. Definition O The midpoint of a segment is the point that divides the segment into two congruent segments.

McGraw-Hill/IrwinCopyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 7 Sampling Distributions.

Prepared by : Walaa Maqdasawi Razan Jararah Supervised by: Dr. Aladdin Masri.

First possibility: Space is FLAT The two-dimensional analog for flat space is a plane (illustrated below). On a plane, and.

Section 3.1: Proof Strategy Now that we have a fair amount of experience with proofs, we will start to prove more difficult theorems. Our experience so.

Connect Four AI Robert Burns and Brett Crawford. Connect Four  A board with at least six rows and seven columns  Two players: one with red discs and.

Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.

The comparison tests Theorem Suppose that and are series with positive terms, then (i) If is convergent and for all n, then is also convergent. (ii) If.

Copyright © Ed2Net Learning, Inc.1 Integers Grade 6.

Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 7 Sampling Distributions.

Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.

How to Play Checkers This presentation is a tutorial on how to play on of the oldest and most popular games in history. Presented By: Cathryn Depuy Project.

TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.

Informed search algorithms Chapter 4. Best-first search Idea: use an evaluation function f(n) for each node –estimate of "desirability"  Expand most.

THE FACTOR GAME!! Before we play make an entry in your math journal titled The Factor Game, then turn to page one in your journal and do the following…

Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.

Distance Formula Mrs. King Geometry Unit 12, Day 8.

PYTHAGORAS Aim: To be able to know Pythagoras’ Theorem All: Will be able to recall theorem. Most: Will be able to use to find the length of hypotenuse.

Chess By Kezia Farley.

Rules Of Chess!!!!!! By: Caylin Stappenbeck. Table Of Contents!!!! Rules*** Conclusion***

Each piece is represented by a symbol. The pieces all stand in the same position at the start of the game the pieces are the Rook, the Knight, the Bishop,

Adding a Sequence of numbers (Pairing Method)

JOHN DOE PERIOD 8. AT LEAST 80% OF HUMANITY LIVES ON LESS THAN $10 A DAY.

Multiples and Factors. Multiples A multiple is a number that is in the times tables. A multiple is a number that is in the times tables. Multiples of.

Heuristic Search Foundations of Artificial Intelligence.

Easy, Hard, and Impossible Elaine Rich. Easy Tic Tac Toe.

The bin packing problem. For n objects with sizes s 1, …, s n where 0 < s i ≤1, find the smallest number of bins with capacity one, such that n objects.

ZONK! Pythagorean Theorem Review 8.G.6, 8.G.7, 8.G.8.

Motion Problems(wind/water) Review Homework 191 # # # 46.

History & Philosophy of Calculus, Session 4 THE INTEGRAL.

How To Play Checkers This Presentation on how to play one of the oldest and most popular games in history. Gage Holzhauer Checkers 1/18/12.

Adversarial Search 2 (Game Playing)

When the king is being attacked directly by an opponent’s piece we say the king is in check.

FTCE 5-9 Test Prep Center for Teaching and Learning.

Content Game of Nim Impartial Games Sprague-Grundy theorem

Cops and Robber on Planar Graphs Presented by Aaron Maurer Results of Work Done at IMA REU 2010 Aaron Maurer (Carleton College), John McCauley (Haverford.

1-5 Postulates and Theorems Relating Points, Lines and Planes

Capitalized Cost Refers to the present worth of an infinite series A

Presentation transcript:

The Angel Problem John H. Conway Presented by Aaron Nickel and Carson English

How to Play The angel and the devil alternate turns on an infinite chess board The angel move to any square in (for example) 1000 kings moves of its position The devil moves by eating away any square The angel wins if he can move forever The devil wins if he strands the angel

Can the angel defeat the devil? Berlekamp has proven a chess king can be defeated on a 32 x 33 board That’s about all we know. Conway is offering cash to solve the problem

Flawed Potential Strategies Potential Functions –Overly Sensitive Counter Strategy –Depends on Angel’s

Only Fools Rush In A fool is an angel that is required to increase his y-coordinate. Theorem: A devil can catch a fool

As the angel moves, he is confined to smaller and smaller areas.

Lax Fools Non-decreasing in one direction Convert to Plain Fool –Of much higher power –1,000 becomes 8,000,000,000 –Can still be trapped

A Lax Fool traveling north

Relaxed Fools Fool has a Limited Decrease Convert to Plain Fool –Of even higher power –Can trap any size laxity

Funneling the Relaxed Fool

Out-and-Out Fools Distance from start strictly increases Divide plane into sectors Divide moves among sectors Relaxed Out-and-Out Fool

The Kaleidoscope Strategy

Diversion Theorem: For each point P and distance D, no matter how the angel moves, there will be two times at the latter of which the angel will be at least D units nearer to P than he was at the former.

His Own Worst Enemy Angel eats millions –Burn every space he could have moved to –Is no worse than before for the angel Angel returns to area finite times Better for angel to not return

Before you sell your soul… While the diverting strategy goads the angel into where he might not want to go, in arbitrarily large journeys, the diversion will appear inconsequential.

Conclusion Still unproved either way Prizes available –$100 for Angel –$1000 for Devil