On Thu, 2007-02-08 at 18:43 -0800, steve uurtamo wrote:
> > It depends. (though "travel light" is always a good adagium,
> > see David Fotlands hilarious compression of a joseki library
> > into 12 bits/move, IIRC ;-)
> 
> this reminds me of an old-school optimized piece of scrabble-playing
> code.  there was a routine that would take an ascii list of words and
> create a DAG out of them, as a ready-made object file, with
> headers and everything.  the makefile linked the playing routine
> against it, creating a ready-made array that existed at runtime.
> 
> http://www.gtoal.com/wordgames/gatekeeper/crab.sh.txt
> 
> truly an awesome piece of software.
> 
> it requires some minor modification to work on a modern machine,
> but it's well worth the effort.

I wrote a scrabble program demo in perl with Tk because someone told me
it would be too slow to be practical (several years ago.)  
Even then it found a good move within a second or two.

The way I stored the dictionary was interesting, but I can't quite
remember the details.   I think each word was stored several times
in the dictionary, a hash of each starting prefix.  a,ap,app,appl,apple
something like that.

I was fun and it was pretty but it wasn't good, it basically maximized
it's choices which isn't a good strategy against good players.

- Don



> s.
> 
> 
> 
> 
>  
> ____________________________________________________________________________________
> Food fight? Enjoy some healthy debate 
> in the Yahoo! Answers Food & Drink Q&A.
> http://answers.yahoo.com/dir/?link=list&sid=396545367
> _______________________________________________
> computer-go mailing list
> computer-go@computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/

_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to