We present an algorithm for the board game go which attempts to find the best move by simulated annealing.
Without including any go knowledge beyond the rules, our implementation leads to a playing strength of about 25 kyu on a 9x9 board.