Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: chess learning vs better search

Author: Charles Roberson

Date: 06:56:10 03/04/06

Go up one level in this thread



     There is a lot of effort in machine learning applied to chess
      and to other areas.

     What you describe is one of the worst ways to do it.
      The random part is the killer to your thought.
      The number of total positions in all possible chess matches is far
      greater than any database can handle.
            Just look at the work on endgame table bases -- they create a
                database of all possible board positions and moves for 3,4,5
                and 6 pieces on the board. They are quite large and take a
                huge amount of time to generate.
     Better to do legal moves instead of random ones. Also, better to not even
     try moves that the search indicates are bad or at least very bad.

      I could go on for pages on this. I suggest you do a paper search in
     google if you want to continue your research on this. Topics could be:
     machine learning, position learning, bayesian learning, neural networks,
     temporal difference learning.......




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.