Author: martin fierz
Date: 15:04:56 12/04/04
Go up one level in this thread
On December 03, 2004 at 17:14:11, john tromp wrote: >Hi Martin, > >>i read your post with interest, because i wrote a bitboard-based connect 4 >> about 2 years ago (www.fierz.ch/4inarow.htm). > >Welcome to the club:-) > >> my test for a win is not very elegant, >>and so i checked out your version. cute! i am using the concept of threats to >>evaluate intermediate positions so my program can play a sensible game without >>calculating to the end. but your win-test is really nice. perhaps i can work out >>some better way to detect threats with this... > >The heuristic connect-4 program I once wrote kept track of threats >and incrementally computed a 12-bit value for each column, >such that adding all these values for different columns together >modulo 4095 could be used to lookup the theoretical outcome. > >However, I found that the program still lacked in strength, since >it failed to see that some new threats would inevitably arise >that would change its perceived outcome. This turned out practically >impossible to correct, so I gave up on that approach. i wonder: i probably need some time to update threats etc that you don't need, but on the other hand, having an idea where the game is going should improve my move ordering. do you think it's not worth it? my experience with history heuristic in connect 4 is terrible to say the least, i'm not using it at all, it always made things worse for me. my current program solves connect 4 in 1520s on an AMD64 3000+ with 128MB hashtable. it searches 4.55 GN to do this. how does your program do? cheers martin
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.