To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.org.ca.rtltorontoOpen lugnet.org.ca.rtltoronto in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 Organizations / Canada / rtlToronto / 9661
    C$: Knowledge-Based Approach —Steve Hassenplug
   I've been reading Victor Allis' Knowledge-Based Approach to Connect-4, and I've come to the conclusion that is not possible to implement it on an RCX. Evaluation of his "9 rules" will result in one of three possibilities; 1=you win, 0=undecided, (...) (21 years ago, 21-Oct-03, to lugnet.org.ca.rtltoronto)
   
        Re: C$: Knowledge-Based Approach —Michael Purvis
     (...) Me too. It's definitely brilliant, but not practical to try to teach a computer. Some parts of his analysis (like the notion of groups and threats, even/odd rows) are excellent, and not that difficult to combine with a ply-based system. But (...) (21 years ago, 22-Oct-03, to lugnet.org.ca.rtltoronto)
   
        Re: C$: Knowledge-Based Approach —Chris Magno
    (...) although this game has taught me more about game theory than I care to discuss, I'm taking a wait and see approach re: Victor. I'm torn between openly discussing this with you, and keeping my "secret" a secret!! damn this competition. :) (...) (21 years ago, 22-Oct-03, to lugnet.org.ca.rtltoronto)
   
        Re: C$: Knowledge-Based Approach —Bruce Sheridan
     (...) You already posted your secret: Move = random(7) (21 years ago, 22-Oct-03, to lugnet.org.ca.rtltoronto)
   
        Re: C$: Knowledge-Based Approach —Michael Purvis
   (...) Ah haha. I know what you mean. My rule of thumb has been that if I think it's a strategy or coding concept that everyone is likely to come up with on their own, then I don't mind discussing it. Any specifics are out, basically. I don't care if (...) (21 years ago, 22-Oct-03, to lugnet.org.ca.rtltoronto)
   
        Re: C$: Knowledge-Based Approach —Chris Magno
    (...) 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)
   
        Re: C$: Knowledge-Based Approach —Steve Hassenplug
   (...) 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 (...) (21 years ago, 23-Oct-03, to lugnet.org.ca.rtltoronto)
 

©2005 LUGNET. All rights reserved. - hosted by steinbruch.info GbR