Author: Russell Reagan
Date: 19:44:52 11/19/02
Go up one level in this thread
On November 19, 2002 at 18:53:51, jefkaan wrote: >Well,a 64bits machine still is nothing ! >For the game of Go for example i then would >like to see a 361 bits machine :) >Presuming people in ComputerGo would be willing to program >with bitboards; guess not. Maybe for parts of the board, >but thats not good enough; for example, there exists >an excellent 'life and death' program which is very >good in Go 'tactics'; but only on small >board, not the official 19 * 19 board. Even with a 361-bit board, bitboards might still work well. Go programs using current methods are obviously not that great. I think that if you could find some sort of pattern matching method to use with bitboards that worked better than an array based method, it might work equally as well (which isn't saying much for a go program) or better. You could use std::bitset<N> as your bitboard container.
This page took 0.4 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.