1 / 17

Go-Moku and Thread-Space Search

Go-Moku and Thread-Space Search. Introduction. Expert Knowledge Threat-space search Result of Threat-space search Result . Expert Knowledge. Definitions and thread sequences Human expert analysis Computer programs ’ strategies. Definitions and thread sequences.

dunn
Télécharger la présentation

Go-Moku and Thread-Space Search

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. Go-Moku and Thread-Space Search

  2. Introduction • Expert Knowledge • Threat-space search • Result of Threat-space search • Result

  3. Expert Knowledge • Definitions and thread sequences • Human expert analysis • Computer programs’ strategies

  4. Definitions and threadsequences • Threat Name:four(a); straight four(b); three(c,d) ;broken-three(e) • To win: Creat a “double threat” • Threat sequence • Winning threat sequence: lead to double threat 必勝

  5. 1個防守 15 14 13 12 2個防守 11 3個防守 10 9 3個防守 8 7 Too late 6 5 4 3 2 1 a b c d e f g h i j k l m n o

  6. Human expert analysis 1.Favorable place for attacking player & where?Based on feeling(long experience) 2.Defensive moves by opponent are disregarded 3.Try to find double threat sequence 4.The threat is failure to find other threat

  7. Human expert analysis 5.When winning threat sequence appear, we can almost ignore defensive moves but “to care defensive four “

  8. Computer programs’ strategies • The strongest Gomoku program use • The difference program: Poly:20~30ply depath search until n-ply using heuristic Vertex:Search depath of 16ply + extended openning book

  9. Threat-space search • Several Notions • Principle

  10. Threat-space search • Several Notions: 1.gain square, cost square, rest sqaure 2.Threat A is dependent on threat B if rest square of A is gain square of B 3.Two dependency tree P&Q are in conflict

  11. Threat-space search • Principle: 1.Threat A& Threat B can’t be in the same tree (it mean that they can’t appear together) 2.Threat space search only include threat of attacker . When the threat can’t work ,find another threat to attack.

  12. Threat-space search 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 a b c d e f g h i j k l m n o

  13. Threat-space search (combine連線) 15 14 13 12 11 10 9 8 7 6 5 4 3 2 h9-h10,i9-i10 can’t be the same tree h9-j10can’t combine in the same line 1 a b c d e f g h i j k l m n o

  14. Result of Threat-space search Pos 2.10.11 no winning line Measuring the efficiency

  15. Result • Tree is split in few hundred subtree • Stored in database • All solution are in tree • Solution are completeness in the tree

More Related