CPSC 335 Assignment 5 Leina Leung TUT 01 (Russel Apu) & Katy Lin TUT 02 (Jagoda Walny)

Slides:



Advertisements
Similar presentations
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
Advertisements

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.
February 7, 2006AI: Chapter 6: Adversarial Search1 Artificial Intelligence Chapter 6: Adversarial Search Michael Scherger Department of Computer Science.
CS 484 – Artificial Intelligence
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.
Prepare for 4x4x4 tic-tac-toe
COMP-4640: Intelligent & Interactive Systems Game Playing A game can be formally defined as a search problem with: -An initial state -a set of operators.
Adversarial Search CSE 473 University of Washington.
MINIMAX SEARCH AND ALPHA- BETA PRUNING: PLAYER 1 VS. PLAYER 2.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
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.
Games Henry Kautz.
Domineering Solving Large Combinatorial Search Spaces.
This time: Outline Game playing The minimax algorithm
Heuristic search heuristic search attempts to find the best tree, without looking at all possible trees.
1 search CS 331/531 Dr M M Awais A* Examples:. 2 search CS 331/531 Dr M M Awais 8-Puzzle f(N) = g(N) + h(N)
DAST 2005 Tirgul 11 (and more) sample questions. DAST 2005 Q.Let G = (V,E) be an undirected, connected graph with an edge weight function w : E→R. Let.
A TIE IS NOT A LOSS Paul Adamiak T02 Aruna Meiyeppen T01.
Slides by Jagoda Walny CPSC 335, Tutorial 02 Winter 2008
Max Min Max Min Starting node and labels Figure 4.20 (pp. 153) Alpha-Beta Prune.
CIS 310: Visual Programming, Spring 2006 Western State College 310: Visual Programming Othello.
1 Solving Ponnuki-Go on Small Board Paper: Solving Ponnuki-Go on small board Authors: Erik van der Werf, Jos Uiterwijk, Jaap van den Herik Presented by:
Adversarial Search and Game Playing Examples. Game Tree MAX’s play  MIN’s play  Terminal state (win for MAX)  Here, symmetries have been used to reduce.
Adversarial Search: Game Playing Reading: Chess paper.
double AlphaBeta(state, depth, alpha, beta) begin if depth
THE RENJU GAME BY ABHISHEK JAIN, PRANSHU GUPTA & RHYTHM DAS PCLUB SUMMER PROJECT PRESENTATION JUNE, L7 IIT KANPUR MENTOR – SANIL JAIN.
Alpha-Beta Search. 2 Two-player games The object of a search is to find a path from the starting position to a goal position In a puzzle-type problem,
1 Adversary Search Ref: Chapter 5. 2 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Minimax Trees: Utility Evaluation, Tree Evaluation, Pruning CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 2 Adapted from slides of Yoonsuck.
CISC 235: Topic 6 Game Trees.
Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Minimax.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
AD FOR GAMES Lecture 4. M INIMAX AND A LPHA -B ETA R EDUCTION Borrows from Spring 2006 CS 440 Lecture Slides.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
Search CSE When you can’t use A* Hill-climbing Simulated Annealing Other strategies 2 person- games.
MIU Mini-Max Graham Kendall Game Playing Garry Kasparov and Deep Blue. © 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.
Adversarial Search CS311 David Kauchak Spring 2013 Some material borrowed from : Sara Owsley Sood and others.
Mark Dunlop, Computer and Information Sciences, Strathclyde University 1 Algorithms & Complexity 5 Games Mark D Dunlop.
Algorithms & Data Structures for Games
University of Amsterdam Search, Navigate, and Actuate – Search through Game Trees Arnoud Visser 1 Game Playing Search the action space of 2 players Russell.
Instructor: Vincent Conitzer
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
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.
Minimax with Alpha Beta Pruning The minimax algorithm is a way of finding an optimal move in a two player game. Alpha-beta pruning is a way of finding.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Parallel Programming in Chess Simulations Tyler Patton.
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Game tree search As ever, slides drawn from Andrew Moore’s Machine Learning Tutorials: as well as from Faheim Bacchus.
Adversarial Search 2 (Game Playing)
Parallel Programming in Chess Simulations Part 2 Tyler Patton.
Trade Off Trade-Off A trade-off is an exchange of one thing for another, or accepting less of one thing for more of another. For example, if you have the.
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Search: Games & Adversarial Search Artificial Intelligence CMSC January 28, 2003.
1 Chapter 6 Game Playing. 2 Chapter 6 Contents l Game Trees l Assumptions l Static evaluation functions l Searching game trees l Minimax l Bounded lookahead.
ADVERSARIAL GAME SEARCH: Min-Max Search
By: Casey Savage, Hayley Stueber, and James Olson
Gravity Off Win by finding a threat sequence
Kevin Mason Michael Suggs
NIM - a two person game n objects are in one pile
Search and Game Playing
Data Structures and Algorithms
CS51A David Kauchak Spring 2019
Unit II Game Playing.
Presentation transcript:

CPSC 335 Assignment 5 Leina Leung TUT 01 (Russel Apu) & Katy Lin TUT 02 (Jagoda Walny)

Explain what strategy you used and why. Alpha-Beta Pruning Why we use Alpha beta pruning? To eliminate non- interested branches of the search tree. Move-Ordering for every empty square:  If next move is a win or blocks opponent from winning then add it to the list  Else if the empty square is between 3 squares or adjacent to 3 connected squares of the same type then add it to the list  Else if this empty square makes the largest connected adjacent square of the same type then add it to the list Transposition Table: We used a transposition table to reduce calculation time. Since at any state of the board there are many different move orderings to get to that state we reduce our calculation of those same state by keeping the utility of that state.

Describe how well your strategy worked (use your overall ranking/score to support your claims), and explain why you think it performed the way it did. The strategy that we decided to use performed well on our part. We rank 3 rd in the competition. Mostly the move ordering is how we win and we only search 7 plies. Limitations: Due to the 3 seconds time limit and the inefficiency of our move ordering we were only able to search 7 plies deep. This only allowed us to look 4 moves in advanced and thus does not always makes the best move.

Describe how well your strategy worked (use your overall ranking/score to support your claims), and explain why you think it performed the way it did.

Our Best Move. Animation - FORK

THE END Thank you.