Just found the corresponding paper at http://www.cs.ualberta.ca/~mmueller/ps/aaai05-tsumego.pdf and some Japanese slides (maybe someone could translate parts different from the paper?) at http://www.fun.ac.jp/~kishi/ppt_file/invited_talk_UT.ppt
The algorithm claims to be more efficient than alpha-beta, but also seems unable to deal with open problems... On 11/5/07, Lars Nilsson <[EMAIL PROTECTED]> wrote: > > On 11/5/07, Adrian Petrescu <[EMAIL PROTECTED]> wrote: > > As a public lectures, do these things get recorded and posted online > > anywhere, Google Techtalk-style? This looks like a really interesting > talk, > > but I live nowhere near where this is being held. Is there any way at > all? > > Perhaps it'll be available here, > http://www.researchchannel.org/prog/displayinst.aspx?fID=880. > > Lars Nilsson > > > > > Thanks for bringing this to our attention at any rate :) > > > > > > On 11/5/07, Jack <[EMAIL PROTECTED]> wrote: > > > This may be of interest > > > JL > > > > > > > > > -----Original Message----- > > > From: Sarah Nightingale (Interaction Recruitment PLC) > > > [mailto:[EMAIL PROTECTED] > > > Sent: 05 November 2007 17:25 > > > To: Jack Lang > > > Subject: Microsoft Research Lectures: Akihiro Kishimoto, Future > > > University-Hakodate > > > > > > MICROSOFT RESEARCH LECTURE > > > This is a PUBLIC lecture > > > ________________________________________ > > > TITLE: Developing the Best Life and Death Solver in Go > > > SPEAKER: Akihiro Kishimoto > > > INSTITUTION: Future University-Hakodate > > > HOST: David Stern > > > DATE: 13 November 2007 > > > TIME: 15:00 - 16:00 > > > MEETING ROOM: Lecture-room small(50 seats) > > > ADDRESS: Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley > > Road), > > > Cambridge > > > Computer Go is one of the ultimate challenges for games research. > Despite > > of > > > a lot of efforts for building state of the art programs, Go is still > > > resistant to current AI techniques, even for solving subproblems such > as > > > Life and Death, or tsume-Go. This talk presents the techniques behind > > > TsumeGo Explorer, a high-performance tsume-Go solver. TsumeGo Explorer > > uses > > > df-pn(r), a new search algorithm that improves the depth-first > > proof-number > > > search algorithm. The program also contains domain-dependent > enhancements. > > > In empirical tests, TsumeGo Explorer out performs GoTools, which has > been > > > the undisputedly best tsume-Go solver for the last 15 years. > > > > > > > > > > > > > > > > > > --- > > > You are currently subscribed to msrclectures as: [EMAIL PROTECTED] > > > To unsubscribe send a blank email to > > > > > > [EMAIL PROTECTED] > > > m > > > Please see our Privacy Statement: > > > http://research.microsoft.com/msrsupp/privacy.htm > > > > > > _______________________________________________ > > > computer-go mailing list > > > computer-go@computer-go.org > > > http://www.computer-go.org/mailman/listinfo/computer-go/ > > > > > > > > > _______________________________________________ > > computer-go mailing list > > computer-go@computer-go.org > > http://www.computer-go.org/mailman/listinfo/computer-go/ > > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
