proceedings ICOB 3nd 2005 ; The 3rd International Conference on Baduk (2005.10)바로가기
페이지
pp.33-49
저자
David. G Doshay, Charlie McDowell
언어
영어(ENG)
URL
https://www.earticle.net/Article/A24771
원문정보
목차
Introduction Computer Go Move Generation 1.1 Candidate Move Selection 1.2 Lookahead : Influence and Territory 1.3 Final Move Selection Branching Faster Play Discussion Results 1.1 Comparing SlugGo and GNU Go 1.2 Normalizing ggValues 1.3 Number of Candidate Moves Versus Branching During Lookhead 1.4 Lookahead Depth Future Direction Conclusion Acknowledgements References 개요 컴퓨터 바둑 결과 앞으로의 전망 결론 References
저자
David. G Doshay [ Computer Science Department, University of California ]
Charlie McDowell [ Computer Science Department, University of California ]