Pattern Matching in Go based on Patricia Tree
碩士 === 國立東華大學 === 資訊工程學系 === 92 === Computer Go is one of the biggest challenge in computer games. Construction of pattern knowledge base and pattern matching plays an important part of a Go program. In this thesis, concept of Patricia Tree is used to store all the patterns systematically:...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48969588279884391448 |
| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 92 ===
Computer Go is one of the biggest challenge in computer games. Construction of pattern knowledge base and pattern matching plays an important part of a Go program.
In this thesis, concept of Patricia Tree is used to store all the patterns systematically: build up the pattern knowledge base, search the patterns that maybe match. In the analysis result of experiments, about ninety percentage of patterns will be filtered .The rest of patterns will take into the final test by Bitmapping method and get the results.
|
|---|