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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Computer Othello

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Thinking Society: How is understanding possible? Webinar & LT2, Computer Laboratory, William Gates Building. Goldsmiths 1, Department of Materials Science & Metallurgy

Other talks

Animating urbanism: the demotic multiplicities of seeing cities digitally Directing Disturbance: Three Theatremakers in Discussion Title to be confirmed Discussion II Good and Evil Plasma Cells: Guardians & Saboteurs of Immunity Title TBC
 

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