You may wish to look at the CUDA docs:
http://developer.nvidia.com/object/cuda.html#documentation
and the Telsa GPU: http://www.nvidia.in/page/tesla_tech_specs.html
Terry McIntyre <[EMAIL PROTECTED]>
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they
No problem. You might also be able to use my Ruby GTP implementation:
http://fantius.com/Gtp.html
On Dec 7, 2007 5:49 AM, Edward de Grijs <[EMAIL PROTECTED]> wrote:
>
>
>
> Hi,
>
> I have a solution now, thanks for all the help.
>
> For those interested, the solution for me:
> I use a ruby
Hi,
I have a solution now, thanks for all the help.
For those interested, the solution for me:
I use a ruby script (thanks Chris), to open de mogo
program (with IO.popen) and with gets en puts
it is possible to read the commands from stdin,
and outputs these commands to mogo.
Obvously ruby c
Aboute the "Nakade problem":
1) There is in principle no problem to correctly handle nakade in
MC/UCT programs. It just a question of making the playouts do it.
2) But doing this requires some smart programming. I think all the
strong progams has been designed by the "What can I do in less th
On Thu, Dec 06, 2007 at 06:39:17PM -0500, Chris Fant wrote:
>
> I propose a far more powerful and correct set of rules:
> 1. Play the move that gives you the best chance of winning.
That would be lovely - if we had a good way of estimating those chances. It
is (should be) well known that MC pla
