| [ QuizWit ] in KIDS 글 쓴 이(By): mkjung (iSTHMUS) 날 짜 (Date): 2000년 11월 7일 화요일 오전 03시 57분 21초 제 목(Title): Re: 5x5 바둑 "The number of possible configurations does not necessarily indicate the hardness of a problem." ========== ya you keep saying this for almost 4 times now. but intentially avoided it in the context of 'go' and 'genome' comparision. i will clearly explain why in sorting algorithm you have n log n performance smaller than the number of configuration. when sorting is applied, it essentially reduces the complexity of the problem to one half. in genome you said the matching is not sequencial one bit by one. which every children knows. however, as somebody said before, it requires a sequential pattern matching. now compare with go game which is obviously a seqencial game. as somebody said, the number of configuration in go game can be bigger than genome if you assume non-stoping rule of some sort. then the number of possible configurations of go is far greater than the genome. so how do you relate it to your claim? you can always explain big theory but you have to tie up little lose end and relate the big theory to the actual problem at hand. :) 키즈깡패단 단장 본협회에가입하실분은연락바떰� 하는일 키즈의 추접떠는 죽돌이들청소 titipas@earthlink.net |