1 / 14

Chess Database Exploration

Chess Database Exploration Dan Alcantara Motivation Want way to easily browse through a hierarchically ordered database of chess games Find all games played by a particular person Compare two different players and their opening strategies Database of chess game records from 2002 – 2007

Thomas
Download Presentation

Chess Database Exploration

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chess Database Exploration Dan Alcantara

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

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

  4. Looking at all games forms a big tree Data set e4 … c5 e5 Nf3 …

  5. Navigating the data set • 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

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

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

  8. Comparing players

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

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

  11. Comparing players

  12. Comparing players

  13. Comparing players

  14. Framework • 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.

More Related