| [ QuizWit ] in KIDS 글 쓴 이(By): mkjung (iSTHMUS) 날 짜 (Date): 2000년 10월 30일 월요일 오후 03시 48분 29초 제 목(Title): Re: 5x5 바둑 assuming that there exist a certain rule that forbid infinite oscillatin of pae (i.e. recursive dynamic) , the number of possibility is no more than O(n^2!). i am sure there exist such rule in go otherwise go game is an infinite game and since i heard go do not have moo-sung-bo. ^^ please kimsr or whatever, don't be such twisted mind. I answered your question in straight fashion regardless my limited knowlege of go. Since you started first, I expect some decency as well. The genome project takes at least 10 years of continous computation using many supercomputer. (they roughly zig-zaged pattern but they are not finished in mathematical sense.) IBM is building new supercomputer just for this purpose. IBM did beat the world chess champion as an exercise of his computing power. Now where is go game in IBM's mind? You still haven't validated your claim that go is harder than Genome project. You might have picked up a little info about NP, PSPAE thing in your class, but still unable to quantify your claim under this very simple fact that Genome project is more complex than go game. To beat chess champion, it took only 1 supercomputer with 4 IBM computer scientists. Before IBM did this, not even a single sould in Russia thoght this is possible. Same thing will happen if enought super coputer and man power as much as Genome project is poured. 키즈깡패단 단장 본협회에가입하실분은연락바떰� 하는일 키즈의 추접떠는 죽돌이들청소 titipas@earthlink.net |