Subject:
|
Re: C$: Knowledge-Based Approach
|
Newsgroups:
|
lugnet.org.ca.rtltoronto
|
Date:
|
Thu, 23 Oct 2003 14:32:03 GMT
|
Viewed:
|
1035 times
|
| |
|
|
In lugnet.org.ca.rtltoronto, Chris Magno wrote:
> Michael Purvis wrote:
> > then I don't mind discussing it. Any specifics are out, basically.
> >
> > I don't care if you know that I evaluate four-five turns in advance, and look
> > for groups, threats, and wins... as long as you have no idea how I do it or how
> > long it takes. :)
>
> I disagree..... if I tell you that I ply 3 deep, you just have to code to 4 or 5 deep.
> you now have a better chance over me.
I'm really trying to share. (hence, this thread)
In fact, I'm willing to admit that my software can currently go 7 ply deep, for
the complex middle-game moves, in under 30 seconds.
That should be able to beat: move=rnd(7)
Now, I just need to build some hardware.
|
|
Message is in Reply To:
 | | Re: C$: Knowledge-Based Approach
|
| (...) I disagree..... if I tell you that I ply 3 deep, you just have to code to 4 or 5 deep. you now have a better chance over me. if I say I have done the research and use the Slabovian concept, you know to counter with the "Upper Un-gabumba Land" (...) (21 years ago, 23-Oct-03, to lugnet.org.ca.rtltoronto)
|
7 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
