1 / 10

Search for Transitive Connections

Search for Transitive Connections. Ling Zhao University of Alberta October 27, 2003. Author: T. Cazenave and B. Helmstetter published in JCIS'03. A . B . C . Motivations. Goal: find double connections Potential problems: Search complexity global search vs. local search

zelia
Download Presentation

Search for Transitive Connections

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. Search for Transitive Connections Ling Zhao University of Alberta October 27, 2003 Author: T. Cazenave and B. Helmstetter published in JCIS'03

  2. A B C Motivations • Goal: find double connections • Potential problems: • Search complexity global search vs. local search b2d vs. 2bd

  3. A B C A B C Examples (white plays first) Transitive connection Non-transitive connection

  4. Basic ideas - Search • Search for each connection separately, and send back a trace (set of intersections) that may change the result. Results: - yes: two strings connected - no: one of the two strings is captured in a ladder - unknown otherwise

  5. Generalized Threats Search • Not mandatory • Order of a threat: number of moves in a row the max player has to play to win the game • Finding possible moves that connect in one move, in two moves, or in three moves

  6. win win Framework • Search connection C1 and C2 separately when max player moves first, then search C1 and C2 when min player is first. • If it is max player to move: Lost if: C1 or C2 is lost when max player plays first Win if: one of connection is win (even if min plays first), and the other is winnable (win if max plays first) and the traces the results depend on are disjoint. lost

  7. If no results found • Change to a global search: alphabeta + TT + killer moves + history heuristic • Reuse previous search results: moves for min player: union of traces moves for max player: moves of order up to the order of maximum threat + 1

  8. Experimental Results • 21 problems: a half from classic problems, and the other half from computer Go games • GTS limited to 4000 nodes • Max moves: order up to 3 • 19 solved, 2 unsolved due to limited moves searched and no ko handling

  9. Examples A C 6523413 nodes, 33.190 sec B Machine used: 1.7 GHz CPU + 100Mb RAM

  10. Conclusions • Effective to search for double connections • Incomplete (results can be wrong) • Too slow sometimes but can be further optimized • Future work: extend it to a more general search problem for combining sub-goals

More Related