IWEC20021 Threat Stacks to Guide Pruning and Search Extensions in Shogi Reijer Grimbergen Department of Information Science Saga University, Japan.

Slides:



Advertisements
Similar presentations
1 Using Partial Order Bounding in Shogi Game Programming Workshop 2003 Reijer Grimbergen, Kenji Hadano and Masanao Suetsugu Department of Information Science.
Advertisements

Anthony Cozzie. Quite possibly the nerdiest activity in the world But actually more fun than human chess Zappa o alpha-beta searcher, with a lot of tricks.
Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Games & Adversarial Search
For Monday Read chapter 7, sections 1-4 Homework: –Chapter 4, exercise 1 –Chapter 5, exercise 9.
September 8th 2005Advances in Computer Games 111 Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons Yoshinori Higashiuchi.
2002/11/15Game Programming Workshop1 A Neural Network for Evaluating King Danger in Shogi Reijer Grimbergen Department of Information Science Saga University.
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.
Application of Artificial intelligence to Chess Playing Capstone Design Project 2004 Jason Cook Bitboards  Bitboards are 64 bit unsigned integers, with.
Adversarial Search CSE 473 University of Washington.
Artificial Intelligence for Games Game playing Patrick Olivier
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
10/19/2004TCSS435A Isabelle Bichindaritz1 Game and Tree Searching.
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.
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,
October 28th 2001GPW20011 Using Castle and Assault Maps for Guiding Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason.
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
Plausible Move Generation Using Move Merit Analysis in Shogi Reijer Grimbergen (Electrotechnical Laboratory) Hitoshi Matsubara (Future University Hakodate)
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
2003/10/6 Go Meeting Hashimoto Tsuyoshi1 Shogi and Realization Probability search Hashimoto Tsuyoshi JSPS Research Fellow.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
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:
A Heuristic Search Algorithm for Capturing Problems in Go Authors: Keh-Hsun Chen and Peigang Zhang Presenter: Ling Zhao August 8, 2006.
1 Selected Goodies of DarkThought Ernst A. Heinz M.I.T. Laboratory for Computer Science (until June 2001)
Othello Sean Farrell June 29, Othello Two-player game played on 8x8 board All pieces have one white side and one black side Initial board setup.
Group 1 : Ashutosh Pushkar Ameya Sudhir From. Motivation  Game playing was one of the first tasks undertaken in AI  Study of games brings us closer.
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.
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.
Lecture 6: Game Playing Heshaam Faili University of Tehran Two-player games Minmax search algorithm Alpha-Beta pruning Games with chance.
Artificial Intelligence in Game Design Lecture 22: Heuristics and Other Ideas in Board Games.
Othello Artificial Intelligence With Machine Learning
Apostles Chess Club Session Three. Chess Piece Symbols The symbols shown above are the ones most used when showing chess pieces in print or on the internet.
Prepared by : Walaa Maqdasawi Razan Jararah Supervised by: Dr. Aladdin Masri.
 Summary  How to Play Go  Project Details  Demo  Results  Conclusions.
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.
October 3, 2012Introduction to Artificial Intelligence Lecture 9: Two-Player Games 1 Iterative Deepening A* Algorithm A* has memory demands that increase.
Algorithms & Data Structures for Games
2004/11/13GPW20041 What Shogi Programs Still Cannot Do - A New Test Set for Shogi - Reijer Grimbergen and Taro Muraoka Department of Informatics Yamagata.
Computing & Information Sciences Kansas State University Lecture 9 of 42 CIS 530 / 730 Artificial Intelligence Lecture 9 of 42 William H. Hsu Department.
2009/11/14GPW20091 Analysis of the Behavior of People Solving Sudoku Puzzles Reijer Grimbergen School of Computer Science, Tokyo University of Technology.
Application of Artificial Intelligence to Chess Playing Jason Cook Capstone Project.
Planning to Guide Opening and Middle Game Play in Shogi Reijer Grimbergen (Electrotechnical Laboratory) Hitoshi Matsubara (Future University Hakodate)
For Wednesday Read chapter 7, sections 1-4 Homework: –Chapter 6, exercise 1.
Deep Blue. background chess: “the touchstone of the intellect” machine would model thinking, some say chess problem “sharply defined” First chess-playing.
Chess and AI Group Members Abhishek Sugandhi Sanjeet Khaitan Gautam Solanki
PYIWIT'021 Threat Analysis to Reduce the Effects of the Horizon Problem in Shogi Reijer Grimbergen Department of Information Science Saga University.
Tetris Agent Optimization Using Harmony Search Algorithm
Solving Kriegspiel endings with brute force: the case of KR vs. K Paolo Ciancarini Gian Piero Favini University of Bologna.
Emerald Valley Chess Camp. Emerald Valley Chess Camp 10 week program DateNovice Level (under 800)Intermediate Level ( ) Jun-11Piece Movement, GameplayGame,
How to play chess? By Mervyn George. The Rules of the Game White always move first White always move first You should always play touch a piece move a.
2008/09/30Computers and Games Cognitive Modeling of Knowledge-Guided Information Acquisition in Games Reijer Grimbergen Department of Informatics.
Chess Strategies Component Skills Strategies Prototype Josh Waters, Ty Fenn, Tianyu Chen.
2006/6/30SIGGI-161 The Society of Shogi - A Research Agenda - Reijer Grimbergen Department of Informatics Yamagata University.
Computers and Games Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason (Oxford.
Adversarial Search and Game Playing Russell and Norvig: Chapter 6 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2004/home.htm Prof: Dekang.
D Goforth - COSC 4117, fall OK administrivia  Exam format – take home, open book  Suicide rule for King’s court Illegal moves cannot move last.
Using Castle Maps for Guiding Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason (Oxford Softworks)
An AI Game Project. Background Fivel is a unique hybrid of a NxM game and a sliding puzzle. The goals in making this project were: Create an original.
Plausible Move Generation Using Move Merit Analysis with Cut-off Thresholds in Shogi Reijer Grimbergen (Electrotechnical Laboratory)
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.
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
Iterative Deepening A*
Adversarial Search and Game Playing (Where making good decisions requires respecting your opponent) R&N: Chap. 6.
Optimizing Minmax Alpha-Beta Pruning Real Time Decisions
Dakota Ewigman Jacob Zimmermann
Heuristic AI for XiangQi
Introduction to Artificial Intelligence Lecture 9: Two-Player Games I
Games & Adversarial Search
Presentation transcript:

IWEC20021 Threat Stacks to Guide Pruning and Search Extensions in Shogi Reijer Grimbergen Department of Information Science Saga University, Japan

IWEC20022 Presentation Overview The problem of time constraints Pruning, search extensions and the horizon effect Pruning and extensions in shogi Threat stacks Using threat stacks for search extensions Using threat stacks for pruning Dealing with horizon moves Preliminary results Conclusions and future work

IWEC20023 How to deal with premature termination of the search? Iterative deepening Ensures that there is a completed search to a certain nominal search depth Search extensions Needed to get a reliable result at each iteration Examples: Quiescence search, Singular extensions Pruning Used to speed up the search and free time for search extensions Examples: Futility pruning, ProbCut The Problem of Time Constraints Horizon problem Push threats over the search horizon

IWEC20024 Pruning and Extensions in Shogi Shogi and chess Shogi is a two-player complete information game similar to chess Differences with chess Drop rule Promotion rule

IWEC20025 Pruning and Extensions in Shogi Extensions in shogi Evaluation function is a combination of material and king danger Need to check both captures and king attack for a position to be quiescent Extended promotion possibilities lead to a sudden change in evaluation value more often Problem in shogi The set of non-quiescent positions is much larger than in chess

IWEC20026 Pruning and Extensions in Shogi Pruning in shogi Futility pruning in shogi It is more difficult to judge inability to recover from a bad position ProbCut in shogi It is more difficult to the establish the likelihood that a deep search can be replaced by a shallow search

IWEC20027 Pruning and Extensions in Shogi The horizon problem in shogi Drop moves make the horizon problem much worse in shogi than in chess In strong shogi programs threat analysis is used for pruning, extensions and detection of horizon moves Gekizashi’s probability classification YSS’s move classification Shotest’s Super-SOMA algorithm No general framework for the use of threats in the search Threat Stacks

IWEC20028 Threat Stacks The method Two stacks to store the threats of both players After each move, the threats by each player are pushed on the stacks When a move is undone, the threat stacks are popped Threat entry Threat identification number Up to three squares for the pieces involved in the threat A value indicating the strength of the threat Weak threats and strong threats Ignore weak threats in case of a strong threat Depend on the phase of the game

IWEC20029 Threat Stacks Threat categories Check Threat to gain material Promotion threat Discovered attack Pins King threats

IWEC Threats Stacks and Extensions Extend the search to empty the threat stacks Procedure a.Determine the strongest threat by each side b.If the side to move has a stronger threat than the opponent, execute the threat c.If the opponent has a stronger threat than the side to move, generate moves to defend against the threat In case of weak threats, this procedure is only followed in the opening and middle game

IWEC Threats Stacks and Pruning Pruning decisions Prune sacrifices one move before the nominal search depth Prune if the number of threats is larger than the remaining search depth In case of a threat, prune moves that neither Execute a threat Resolve a threat Introduce a threat Pruning only done in positions with a strong threat

IWEC Threats and the Horizon Problem Horizon moves are dealt with in two steps 1.Detect a potential horizon move 2.Analyze threat stacks at the nominal search depth to see if the original threat is still there This is why threat stacks are used

IWEC Results Tactical shogi problems VersionTotalSolvedTime used Threat stacks (42%)02:14:12 Quiescence search29897 (33%)02:34:45 Set of 298 tactical shogi problems from Shukan Shogi 30 seconds on a 1.2 GHz Pentium III Comparison of threat stacks and quiescence search

IWEC Results Material vs. Attack/defense 115 tactical problems involving material VersionTotalSolvedTime used Threat stacks11593 (81%)00:50:31 Quiescence search11599 (86%)01:00: tactical problems involving attack and defense VersionTotalSolvedTime used Threat stacks17589 (51%)01:18:27 Quiescence search17557 (33%)01:38:12

IWEC Conclusions and Future Work Conclusions Threat stacks can be used for making decisions about search extensions, pruning and to detect horizon moves Preliminary results indicate that threat stacks may improve the tactical ability of a shogi program Future work Investigate if the tactical improvement results in winning more games Use threat stacks to guide best first search