Gravity Off Win by finding a threat sequence

Slides:



Advertisements
Similar presentations
Probability u Tree Diagrams. Tree Diagrams u Shows all possible outcomes – Total amount of choices from a group of items – How many of a particular item.
Advertisements

Adversarial Search Chapter 6 Section 1 – 4. Types of Games.
1/8 AND, OR and NOT b How many boys? b How many girls? b How many blue? b How many red?
Artificial Intelligence Presentation
The Build-up of the Red Sequence at z
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
AI for Connect-4 (or other 2-player games) Minds and Machines.
For Monday Read chapter 7, sections 1-4 Homework: –Chapter 4, exercise 1 –Chapter 5, exercise 9.
Branch and Bound Optimization In an exhaustive search, all possible trees in a search space are generated for comparison At each node, if the tree is optimal.
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.
Adversarial Search: Game Playing Reading: Chapter next time.
Adversarial Search Board games. Games 2 player zero-sum games Utility values at end of game – equal and opposite Games that are easy to represent Chess.
Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.
November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.
Games and adversarial search
STRATEGO ® By Kevin Braun & Dylan Brandtner. Game Overview STRATEGO is a grid-based 10 x 10 board game featuring two opposing armies of 40 pieces. STRATEGO.
Generalized Threats Search Paper Review Paper Author: T. Cazenave Review by: A. Botea.
A TIE IS NOT A LOSS Paul Adamiak T02 Aruna Meiyeppen T01.
Problem Solving and Search in AI Heuristic Search
Adversarial Search: Game Playing Reading: Chess paper.
THE RENJU GAME BY ABHISHEK JAIN, PRANSHU GUPTA & RHYTHM DAS PCLUB SUMMER PROJECT PRESENTATION JUNE, L7 IIT KANPUR MENTOR – SANIL JAIN.
Backtracking.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
CISC 235: Topic 6 Game Trees.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Z. Z Scissors Paper Stone  Scissors beats paper (cuts it)  Paper beats rock (wraps it)  Rock beats scissors (blunts it)  Showing the same is a draw.
Investigation #1 Factors and Products.
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.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Probability u Tree Diagrams. Tree Diagrams u Shows all possible outcomes – Total amount of choices from a group of items – How many of a particular item.
Key Events in North America Colored Maps Color Key France = red Spain = yellow US = blue Great Britain (England) = green Mexico = purple.
Game tree search Chapter 6 (6.1 to 6.3 and 6.6) cover games. 6.6 covers state of the art game players in particular. 6.5 covers games that involve uncertainty.
Adversarial Search. Game playing u Multi-agent competitive environment u The most common games are deterministic, turn- taking, two-player, zero-sum game.
Search: Games & Adversarial Search Artificial Intelligence CMSC January 28, 2003.
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
1 Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game.
Adversarial Search and Game-Playing
Games and adversarial search (Chapter 5)
Edward de Bono’s 6 Thinking Hats
Instructor: Vincent Conitzer
4. Games and adversarial search
Games and adversarial search (Chapter 5)
Optimizing Minmax Alpha-Beta Pruning Real Time Decisions
As the title suggests, the aim of First to Eight is to be the first player to reveal eight circles within the play zone. The game can be played by 1 -
Probability Tree Diagrams.
David Kauchak CS52 – Spring 2016
Here is a puzzle I found on a t-shirt
Hire Toyota Innova in Delhi for Outstation Tour
Dakota Ewigman Jacob Zimmermann
CSCI 5582 Artificial Intelligence
Games with Chance Other Search Algorithms
Car Race – Linear Sequences
Kevin Mason Michael Suggs
Instructor: Vincent Conitzer
Search and Game Playing
A First Grade Number Routine
Probability Tree Diagrams.
Probability Tree Diagrams.
Games & Adversarial Search
CS51A David Kauchak Spring 2019
As the title suggests, the aim of First to Eight is to be the first player to reveal eight circles within the play zone. The game can be played by 1 -
CS51A David Kauchak Spring 2019
Welcome to Who Wants to be a Winner?.
Tree Diagrams Monday, October 15, 2012 Mr. Pearson
Which Team Will Win? Think back to this previous lesson where we compared frequency trees with a probability tree diagram:
Fill in missing numbers
Fill in missing numbers
Probability Tree Diagrams.
Presentation transcript:

Gravity Off Win by finding a threat sequence But it’s difficult to capture this in an evaluation function Focus on search optimizations like pruning the tree and move ordering

Handling Threats X O X X X O X O X Branching factor = 1 Order 1 Threats: X X O X Order 2 Threats: O Branching factor ≈ 3 X

Gravity On Win by being in a good position when the board fills up As the board fills up, options become more limited Focus on coming up with a good evaluation function

X O T No one wants to move here ?

Threat Map T T T T T Assuming no new threats develop, who wins? Types of threats: Critical Non-critical Special cases (useless/win threats) T T T T T Turn: Blue Turn: Red Winner: Blue