1 / 15

Genetically Programmed Strategies For Chess Endgame

Genetically Programmed Strategies For Chess Endgame. Introduction. Backgroud Evolving Strategies For KRK Results. Background. Computing Brute-Force Algorithm Pattern Use DataBase instead of BFA Unstandable Readable Alpha-Beta pruning Algorithm Improve evalution function

sven
Télécharger la présentation

Genetically Programmed Strategies For Chess Endgame

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. Genetically Programmed Strategies For Chess Endgame

  2. Introduction • Backgroud • Evolving Strategies For KRK • Results

  3. Background • Computing • Brute-Force Algorithm • PatternUse DataBase instead of BFA • Unstandable Readable • Alpha-Beta pruning Algorithm • Improve evalution function • Genetic Algorithm by neural network

  4. Evolving Strategies For KRK • Focus on tree of moves and evalution functions not algorithm and not table • Learn how to play effectively use patten • Use Genetic Programming (GP) • Compute Correct Strategy • Generate an effective strategy with fitness function (outcome)

  5. Evolving Strategies For KRK • Pattern:good enough for strategy • Genetic encoding and genetic operator • Binary Tree with operator-strategy • Operator as Node; Function(moves) as Leaves • Each Operator can be read use if-then-else • Transition(node-node) use logical AND • Mutation(replace operator by random)

  6. Evolving Strategies For KRK • Fitness: • fi:partical better game value • Mi:total moves • N:program tree size

  7. Results • First experiment

  8. Results • Fourth experiment

  9. Results • Compute Strategy • Pattern

More Related