| [ QuizWit ] in KIDS 글 쓴 이(By): mkjung (iSTHMUS) 날 짜 (Date): 2000년 11월 4일 토요일 오후 07시 49분 29초 제 목(Title): Re: 5x5 바둑 환상님, chess가 완전히 풀렸다면... 선수를 두는 사람이 이깁니까? 집니까? 아니면 비깁니까? ^^; 수학을 전공하신 분이 이런 식의 "엄밀하지 않은" 말을 함부로 해도 됩니까? 그리고 Genome Project에 쓰이는 알고리즘들은 NP 중에서도 극히 어려운 문제들입니다. (supoerstring, supersequence, ...) -- 박.. ============== i think the white player always has to win in chess assumping all the move is optimized. (the rate of white winning is greater in professional chess. it is just like go. one first move makes the big difference.) what i mean by the chess problem is solved is that, after IBM beated human player, no one cares about chess anymore. (i am sure the interest in chess algorithm dwindled in computer science. ^^ ) from the point of view of algorithms, these kind of problem looks interesting. but from the mathematical point of view, it is boring to solve chess problem completely. give me 100000 IBM deep thought, i will solve chess problem for you. ^^ there are only finite number of moves. whatever NP or NSPACE says if you add more computers exponentially ^^ , the problem becomes mathematically trivial. the real challenge is that with limited computing resource, how to make the most efficient algorithm. ps. why kimsr(?) steams like that? hmmmmmmm..... must have failed advanced algorithm course. :) |