vortidutch.blogg.se

Othello strategy
Othello strategy












othello strategy
  1. #Othello strategy archive
  2. #Othello strategy code

Pang also includes an executable of their program, but, according to a TA email, training on it would be against the honor code (as it is outside of *this* class). They also have what looks like a very reasonable time management scheme. Interestingly, they use two "bitboards" (one for each color), rather than one combined bitboard, to represent the game state.we might want to consider doing this. I am less impressed with their evaluation function, however: it looks like it's mostly based on IAGO/BILL, older Othello programs which use complicated features which are slow to compute (rather than simple features which are fast to compute). They also describe what looks like an effective, fast "killer tables" method. For example, their transposition table uses a "Least-Recently Used entry eviction scheme" to be able to only store a constant number of entries in each bucket (they also suggest tips for hash functions, etc). Jimmy Pang and his group won the contest last year their writeup describes a number of techniques.(A copy of this discussion is at the Generation 5 AI site.) A cool othello applet by Marc Mandt - its algorithms aren't that complicated, but it has a nice interface (it even shows you the legal moves) and it links to a well-illustrated, albiet brief, discussion of strategy (specifically, evaluating game states based on symmetry, board position, and mobility).

#Othello strategy archive

  • Andrea Zinno's TooThought! - an Othello-playing program, with a brief explanation of how it works also includes link to Thor game archive (also available in French!.
  • They use a number of Buro's techniques, including a new implementation of Multi-Prob Cut.
  • Keyano is another Othello-playing program with a great "Keyano unplugged" document explaining how it works.
  • For game-state evaluation, he suggests starting with weighting squares, but then moving towards more sophisticated approaches based on statistical learning (cf Michael Buro's papers) Some of his techniques are alpha-beta pruning, move ordering ("killer responses," shallow searches), selective search (or "multi prob-cut," discarding what look like bad searches before you get to lower depths), storing positions in a hash/"transposition" table, etc., etc. He talks about the inner workings of strong Othello programs, among other things.

    othello strategy

  • Gunnar Andersson's homepage - developer of a number of Othello playing programs, such as WZebra.
  • Annotated bibliography of Othello programming - a great list of articles we might want to check out.
  • Comment jouer les ouvertures? - a page on opening strategy in French.
  • The Bat Opening - a detailed analysis of one opening.
  • Java Othello Openings - an applet that plays out the standard openings, with a text version.
  • Opening Strategy - an introductory page by George Ortiz.
  • Offline: Othello: Brief and Basic (Official handbook of the United States Othello Association) and An introduction to strategy and tactics for the game of Othello by Ted Landau (Former USOA National Champion).
  • Similar to the Dutch page, although with more examples.
  • French Othello Strategy Guide - written by Emmanuel Lazard and transalted by Colin Springer goes into notation and then explains various points of strategy many copies on the web at various sites.
  • Joel Feinstein's Othello page - a number of interesting articles and links, such as Why too many pieces can be bad and when to sacrifice the corner spaces.
  • Jonathan's Reversi Page - some basic strategy and links.
  • Dutch Othello Strategy - good and concise strategy guide from the Netherlands.
  • Othello Strategy Site - comprehensive site that is the first to come up on Google.
  • othello strategy

    Note that the CS 221 version of Othello is slightly different than the standard one to see an example of the board, see the handy-dandy othello board template, which we used for doodling and sketches during our project. This was the working bibliography/ideas page for "Team Desdemona," a CS 221 project team composed of Karen Corby, Lilly Irani, Patrick Perry, and Luke Swartz. Othello Strategy and Ideas Othello Strategy and Ideas Team Desdemona














    Othello strategy