University of Cambridge > Talks.cam > Inference Group > Computer Othello

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Computer Othello

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Phil Cowans.

Many years ago Kai-Fu Lee and I wrote BILL , a world-champsionship-level Othello program (now released as free software). It had an automatically trained nonlinear evaluation function with sophisticated understanding of edge play; it used alpha-beta searching in the middle-game; and it performed exact searches in the endgame. I will describe BILL ’s search algorithms and evaluation function; discuss why Othello, in contrast to chess or Go, is much easier for computers than for humans; and show a few examples from BILL ’s games.

This talk is part of the Inference Group series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lucy Cavendish College Type the title of a new list here MRC Epidemiology and CEDAR Seminars

Other talks

An SU(3) variant of instanton homology for webs Organoid systems to study the maternal-fetal dialogue of early pregnancy Finding the past: Medieval Coin Finds at the Fitzwilliam Museum How to lead a happy life in the midst of uncertainty Doctor Who: Gridlock Simulating Neutron Star Mergers Investigating the Functional Anatomy of Motion Processing Pathways in the Human Brain 100 Problems around Scalar Curvature Towards a whole brain model of perceptual learning Café Synthetique: Graduate Talks! Modelling discontinuities in simulator output using Voronoi tessellations
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity