Plausible Move Generation Using Move Merit Analysis in Shogi Reijer Grimbergen (Electrotechnical Laboratory) Hitoshi Matsubara (Future University Hakodate)

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

Chess 101 This tactic is critical in winning, or not losing, in this situation because many endgames come down to kings and pawns being the only pieces.

Apostles Chess Club Lesson #4. Algebraic Chess Notation System The board is set up from white’s position. Black must look at the board from the white.

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.

ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2008.

CS 484 – Artificial Intelligence

2002/11/15Game Programming Workshop1 A Neural Network for Evaluating King Danger in Shogi Reijer Grimbergen Department of Information Science Saga University.

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.

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.

Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Computers Playing Games Arif Zaman CS 101. Acknowledgements Portions of this are taken from MIT’s open-courseware

Deflection Tactics Chess I

Automated reasoning about retrograde chess problems using Coq Marko Maliković, Ph.D. The Faculty of Humanities and Social Sciences University of Rijeka,

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,

Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.

October 28th 2001GPW20011 Using Castle and Assault Maps for Guiding Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason.

November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.

Generalized Threats Search Paper Review Paper Author: T. Cazenave Review by: A. Botea.

ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2006.

Adversarial Search: Game Playing Reading: Chess paper.

Monte Carlo Go Has a Way to Go Haruhiro Yoshimoto (*1) Kazuki Yoshizoe (*1) Tomoyuki Kaneko (*1) Akihiro Kishimoto (*2) Kenjiro Taura (*1) (*1)University.

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.

CSC 412: AI Adversarial Search

Chess Merit Badge Chess Basics: Set Up the Board & Basic Rules by Joseph L. Bell © 2011.

Aayush Garg Pecha-Kucha Design Games 10. Games I like Strategy games Mathematical games Paper and Pencil games Street games.

Artificial Intelligence in Game Design Lecture 22: Heuristics and Other Ideas in Board Games.

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.

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.

Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides)  Motivation  Game Trees  Evaluation.

2004/11/13GPW20041 What Shogi Programs Still Cannot Do - A New Test Set for Shogi - Reijer Grimbergen and Taro Muraoka Department of Informatics Yamagata.

2009/11/14GPW20091 Analysis of the Behavior of People Solving Sudoku Puzzles Reijer Grimbergen School of Computer Science, Tokyo University of Technology.

Instructor: Vincent Conitzer

Othello Playing AI Matt Smith. Othello 8x8 Board game 8x8 Board game Try to outflank opponents pieces Try to outflank opponents pieces Winner ends up.

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

Planning to Guide Opening and Middle Game Play in Shogi Reijer Grimbergen (Electrotechnical Laboratory) Hitoshi Matsubara (Future University Hakodate)

1 Adversarial Search CS 171/271 (Chapter 6) Some text and images in these slides were drawn from Russel & Norvig’s published material.

CHECKERS: TD(Λ) LEARNING APPLIED FOR DETERMINISTIC GAME Presented By: Presented To: Amna Khan Mis Saleha Raza.

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

PYIWIT'021 Threat Analysis to Reduce the Effects of the Horizon Problem in Shogi Reijer Grimbergen Department of Information Science Saga University.

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.

DEEP RED An Intelligent Approach to Chinese Checkers.

How to Play Chess. Name of Each Piece The relative values of the chess pieces 9 points 5 points 3+ points 3 points 1 point.

Summary of the Moves of Chess

Lesson 1 History of Chess Why We Teach Chess Goal of Chess.

A game based off of the esteemed classic By: Tadziu Kosiara.

What is chess???? The game chess has been described as an art, a science and a sport. Almost anyone can learn how to play. Some top chess champions can.

CHESS 2: Castling and Forking…and a Stalemate A Levoy Power Point.

The Basics Of Chess Student Name: Jovannie Charles Date: 3/25/11.

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.

CHESS Basics for Beginners. BOARD SET-UP The letters go across the board in front of you. “White on right!” Each player has a white square in their right.

Computers and Games Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason (Oxford.

2008/11/08GPW20081 A Reproduction Experiment Concerning the Relation Between Perceptual Features and Memory in Shogi Reijer Grimbergen Department of Informatics.

CHESS Club.  The game of chess is over 1300 years old and is one of the most popular games in the world. It has received more total thought time than.

Using Castle Maps for Guiding Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason (Oxford Softworks)

Plausible Move Generation Using Move Merit Analysis with Cut-off Thresholds in Shogi Reijer Grimbergen (Electrotechnical Laboratory)

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

D1 Miwa Makoto Chikayama & Taura Lab

Ramblewood Middle Chess Club

Chess Basics: Set Up the Board & Basic Rules

Using Bitboards for Move Generation in Shogi

On the Relation Between Perception, Memory and Cognition in Games

CS51A David Kauchak Spring 2019

Presentation transcript:

Plausible Move Generation Using Move Merit Analysis in Shogi Reijer Grimbergen (Electrotechnical Laboratory) Hitoshi Matsubara (Future University Hakodate)

Full-width Search and Plausible Move Generation Full-width search World championship level programs in chess, checkers and Othello. Plausible Move Generation Important in the early days of chess research. Good alternative in domains where full-width search can not search deep enough:  Large average number of legal moves (e.g. Go, Shogi).  Single agent search problems with extremely long solution sequences (e.g. Sokoban). Interesting for cognitive science.

Why Plausible Move Generation in Shogi? High average branching factor (80) compared to chess (35). Average branching factor increases as the game progresses. Time constraints are strict.

Legal Moves in Shogi

Plausible Move Generator Set for Shogi PMG-Goal Capture Material Promote Piece PMG-Th Check Attack king Attack material Discovered attack Threaten promotion PMG-DefTh Defend checks Defend king Defend material Defend discovered attacks Defend against promotion PMG-Pim Defend pins Tie improvement Defend undefended pieces Defend against exchange Cover squares in own camp Develop pieces PMG-DefPIm Pin piece Cover squares in enemy camp Avoid development

Move Merit Analysis In our approach it is possible that moves are generated by more than one PMG. Knowledge about which PMGs generated a move is used for analyzing the merit of a move. Move Merit Analysis: Every PMG gives a value to the generated move based on the importance of the PMG. E.g.: Winning a rook is more important than improving the position. Possible performance improvements: Move ordering is improved, aiding alpha-beta search. Additional cuts are possible: discard all moves with a negative MMA value.

Experimental Results We compared the behavior of: PMG-All: Generate all moves from the plausible move generator set. PMG-MMA: Generate all moves with a positive MMA value. Four experiments: 1. Plausible move generation test. 2. Move ordering test. 3. Search comparison test. 4. Self play experiment.

Experimental Results (1) Plausible Move Generation Test

Savings and accuracy of PMG-All and PMG-MMA in 100 test games: VersionNot Generated Accuracy (%) Savings (%) PMG-ALL8199.4%23.7% PMG-MMA %46.5% PMG-MMA: savings much better and only slightly less accuracy

Experimental Results (2) Move Ordering Test Only very few moves are ordered low by MMA

Experimental Results (3) Search Comparison Test Performance in 298 tactical shogi problems from Shukan Shogi: CatTotal PosFull WidthPMG-ALLPMG-MMA Tot Only for PMG-MMA there is a significant improvement

Experimental Results (4) Self Play Experiment We played 20 game matches between shogi programs that use PMG-MMA, PMG-All and Full-width search: NoVersion123Result 1PMG-MMAX15-5 (75%) 20-0 (100%) 35-5 (87.5%) 2PMG-ALL5-15 (25%) X16-4 (80%) (52.5%) 3Full-width0-20 (0%) 4-16 (20%) X4-36 (10.0%) PMG-MMA outplays PMG-All and Full-width search

Conclusions Plausible move generation deserves further investigation. Plausible Move Generation with Move Merit Analysis gives important improvements of the search performance in shogi. Move Merit Analysis is vital for our method of plausible move generation.