Re: [computer-go] Search = Bad!

[Robin Kramer <robin@xxxxxxxx>]

I would like to see someone conduct some preprocessing(math fractals or 
whatever), without a search.  How would that work, just start writing 
the formula then by the time you are done with the formula you have a 
formula which predicts the outcome of the game?

Start with a search end with a search and search inbetween.

Robin


Matt Gokey wrote:

> Don Dailey wrote:
>
> > I didn't present it for that reason and I'm not the one that claimed
> > it could be played by formula.  But this might be a first step towards
> > creating a formula if it's even possible, so I presented it as a
> > curiosity.
> Yeah, I understood that.
>
> > Which makes me wonder if there is a reasonable alternate way to
> > represent the game of Go?
> Maybe an abstract graph representation of some kind?
>
> > Incidently, I'm no math whiz, but isn't a computer program basically a
> > mathematical representation of something?  And isn't a computer
> > function pretty much a mathematical function?  Isn't a recursive
> > function a finite series?
> But the question is whether there exists a computational shortcut.
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/