Xref: utzoo comp.ai:8014 rec.games.go:2602 Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!apple!amdahl!JUTS!kpc00 From: kpc00@JUTS.ccc.amdahl.com (kpc) Newsgroups: comp.ai,rec.games.go Subject: Re: Info Request: USCF rating as a function of search ply? Message-ID: Date: 16 Nov 90 01:42:01 GMT References: <9011091027.aa03480@PARIS.ICS.UCI.EDU> <11155.273b8b99@amherst.bitnet> Sender: kpc00@ccc.amdahl.com Organization: my-organization Lines: 19 In-reply-to: tjbryce@amherst.bitnet's message of 10 Nov 90 05:09:45 GMT In article <11155.273b8b99@amherst.bitnet> tjbryce@amherst.bitnet writes: Each additional ply of search adds about 200 points to a programs plying strength. (sources: Scientific American, October 1990 and the book Chess Skill in Man and machine, as well) How about in go? (N.B. I think that some approaches use shallow or even no search, other than perhaps for ladders.) Any interesting patterns for kyu ratings? P.S. What's the status for PD go program frameworks? What are the good ones out there, and are there any multilingual ones (e.g. C or C++ and a high level language combined)? -- If you do not receive a reply from me, please resend your mail; occasionally this site's mail gets delayed. Neither representing any company nor, necessarily, myself.