Chess Database Exploration Dan Alcantara. Motivation Want way to easily browse through a hierarchically ordered database of chess games Want way to easily.

Slides:

Advertisements

Similar presentations

Steps to Making a Decision Step 5: Evaluate results of the decision and accept responsibility for results of the decision. Step 4: Make a decision,

Advertisements

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.

WEB DESIGN – SEC 4-11 PART OR ALL OF THIS LESSON WAS ADAPTED FROM THE UNIVERSITY OF WASHINGTON’S “ WEB DESIGN & DEVELOPMENT I ” COURSE MATERIALS PSEUDO-CLASS.

Decision Tree Induction in Hierarchic Distributed Systems With: Amir Bar-Or, Ran Wolff, Daniel Keren.

BAD PRESENTATIONS (and how not to give one..) Adopted from Katherine Compton Dept. of ECE UW-Madison Mark L. Chang Dept. of ECE Olin College of Eng.

The Wonderful World of Hackenbush Games And Their Relation to the Surreal Numbers.

©Marian Small, 2010 Big Ideas K-3 Session 1 Marian Small.

ECO290E: Game Theory Lecture 9 Subgame Perfect Equilibrium.

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

Searching Algorithms Finding what you are looking for.

September 26, 2012Introduction to Artificial Intelligence Lecture 7: Search in State Spaces I 1 After our “Haskell in a Nutshell” excursion, let us move.

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

Search Strategies.  Tries – for word searchers, spell checking, spelling corrections  Digital Search Trees – for searching for frequent keys (in text,

G51IAI Introduction to AI Minmax and Alpha Beta Pruning Garry Kasparov and Deep Blue. © 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.

Deflection Tactics Chess I

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

Artificial Intelligence in Game Design

Going Deeper with Content and Practice Alanna Mertens ISBE Math Content Area Specialist Content contained is licensed under a Creative.

Connect Four Michelle Chen Felix Chung Annabel Hung Raymond Wong.

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.

Math 310 Section 7.2 Probability. Succession of Events So far, our discussion of events have been in terms of a single stage scenario. We might be looking.

Online Chess Project 3 Due date: April 17 th. Introduction Third in series of three projects This project focuses on adding online support –2 players.

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

CIS 310: Visual Programming, Spring 2006 Western State College 310: Visual Programming Othello.

Adversarial Search: Game Playing Reading: Chess paper.

Algorithmic Complexity Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

SUBGAME PERFECT EQUILIBRIUM Prof. Dr. Yeşim Kuştepeli ECO 4413 Game Theory 1.

C o n f i d e n t i a l HOME NEXT Subject Name: Data Structure Using C Unit Title: Trees.

Parallel operations Episode 8 0 Parallel conjunction and disjunction Free versus strict games The law of the excluded middle for parallel disjunction.

Social Network Analysis: What it Is, How it Works, and How You Can Do It Prof. Paul Beckman San Francisco State University.

Team Members Satyajit Deshmukh Mandar Samant Pradnyesh Gore Nikhil Bagewadi Rakki Chesu.

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

 What can learning about ‘attention’ teach us about how we learn?  How can we connect our learning about ‘attention’ to our experiences to gain a better.

Knight Work Charlie Keen. One move * * N * * Edge effects 1 N * * N * * * N.

Algorithmic Software Verification III. Finite state games and pushdown automata.

Problems, Problem Spaces and Search

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.

SPACIOUS-MIND – RATE YOUR SKILL IN CHESS TESTS.

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

Software Design 8.1 Model, View, Controller: battleship l Who does what, where are responsibilities in MVC?  This is a pattern, so there's isn't "one.

Using Tree Diagrams to Represent a Sample Space. Imagine that a family decides to play a game each night. They all agree to use a tetrahedral die (i.e.,

Marin, Vanessa P. 4. Wireless Mouse Different Designs Doesn’t use up a lot of space No wire Easy to misplace.

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.

Learning Othello The quest for general strategy building.

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,

Exploring Rocks Unit 4: Lesson 1 In what ways can rocks be described?

Compare GALAXION With  Compare GALAXION With  Galaxion is BIGGER Galaxion is BIGGER Galaxion is BETTER Galaxion is BETTER Galaxion is MORE.

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.

Simple Circuits Series circuit –All in a row –1 path for electricity –1 light goes out and the circuit is broken Parallel circuit –Many paths for electricity.

Learning to Play the Game of GO Lei Li Computer Science Department May 3, 2007.

Progress Report and Discussion.  Demo and discussion of current features  UI development issues  Further work  Discussion of possible underlying models.

Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)

CS 115 Lecture 17 2-D Lists Taken from notes by Dr. Neil Moore.

Literature Circles Ideas for sharing tools. Sharing Tools A tool should usually take 20 minutes or less to create It needs to actively involve all group.

Game Playing Why do AI researchers study game playing?

Section 14.2 Applications of Counting Principles to Probability

William Grosso Stanford Medical Informatics Stanford University

Technology in the past 50 years

David Kauchak CS52 – Spring 2016

ECF Arbiter Seminar - Material by CAA

Chess Basics: Using Algebraic Notation

Search and Game Playing

QPTM- Application Fundamentals

Game Playing Fifth Lecture 2019/4/11.

PICK 6 Game Board

Strategic Thinking There are two concepts that all chess players must understand from the start; strategy and tactics. Beginners often confuse the two.

Understanding Chess Notation

Presentation transcript:

Chess Database Exploration Dan Alcantara

Motivation Want way to easily browse through a hierarchically ordered database of chess games Want way to easily browse through a hierarchically ordered database of chess games Find all games played by a particular person Find all games played by a particular person Compare two different players and their opening strategies Compare two different players and their opening strategies

Data set Database of chess game records from 2002 – 2007 Database of chess game records from 2002 – 2007 Each record contains: Each record contains: Exact sequence of moves played Exact sequence of moves played Player names Player names Player rankings Player rankings Chess opening designation Chess opening designation [Event "Sparkassen Gp 1"] [Site "Dortmund GER"] [Date " "] [Round "1"] [White "Topalov,V"] [Black "Lutz,C"] [Result "1-0"] [WhiteElo "2745"] [BlackElo "2650"] [EventDate " "] [ECO "B48"] 1. e4 c5 2. Nf3 e6 3. d4 cxd4 4. Nxd4 Nc6 5. Nc3 Qc7 6. Be3 a6 7. Qd2 Nf6 8. O-O-O Bb4 9. f3 Ne5 10. Nb3 b5 11. Kb1 Nc4 12. Bxc4 bxc4 13. Nc1 Qb7 14. N1e2 Rb8 15. b3 O-O 16. Bf4 Ra8 17. etc.

Data set Looking at all games forms a big tree Looking at all games forms a big tree e4 c5e5 Nf3… …

Navigating the data set Current approaches either step through the data set or present all of the games in a simple listing Current approaches either step through the data set or present all of the games in a simple listing Hard to get an overview of what each step causes Hard to get an overview of what each step causes

Navigating the data set Each node of the hyperbolic tree represents one particular configuration of the board Each node of the hyperbolic tree represents one particular configuration of the board Each player action is represented by a connection between two nodes Each player action is represented by a connection between two nodes Gives rough idea of popularity and success rate of particular action Gives rough idea of popularity and success rate of particular action

Navigating the data set Mousing over the nodes converts the chess notation into an actual board Mousing over the nodes converts the chess notation into an actual board Navigating the tree darkens areas which have been previously visited Navigating the tree darkens areas which have been previously visited

Comparing players

Hyperbolic tree not really suitable for comparisons Hyperbolic tree not really suitable for comparisons Can focus on one or two players to see which pathways were taken Can focus on one or two players to see which pathways were taken Colors blend where the pathways overlap Colors blend where the pathways overlap

Comparing players The chess games form two trees Branch for every different player action Branch for different “chess openings” (strategies)

Comparing players

Framework Tree structures were separated from the visualization, so multiple types of visualizations can be used on the same data. Tree structures were separated from the visualization, so multiple types of visualizations can be used on the same data. Problem was that I couldn’t come up with anything interesting with the given timeframe. Problem was that I couldn’t come up with anything interesting with the given timeframe.