Author: Ingo Lindam

Date: 16:20:44 10/25/02

Go up one level in this thread

>I agree with Bob here. Somewhere in the program you must have a function >to combine all the probabilities into a comparision with an other >set of probabilities. > >In order to save yourselve loads of system time you could also implement >that function into the evaluation function, in which case you only >have to return an integer. > >Then you have again a chess engine working at the same way. Away probabilities. >Just return an integer :) Yes, at this point I have to agree as well... ofcourse to compare the scores/probabilities of two positions I have to obtain a single score at this moment. The advantage I see in following points: a) I can in different situations change the function giving my score out of P+ and P= (and P-). b) more important for me seems the aspect of having clearly interpretable scores (also in the meaning of distinguishing draw positions and positions with equal chances) c) making decisions based on statistical laws And btw probabilities and integers don't have to be the opposite. You can ofcourse compare and add -log(p) instead of compare and multiply p. Even more important for me was the suggestion of let the computer use its self generated patterns derived from a huge data base of games. Best regards and thank you for feedback. Ingo

- Re: likelihood instead of pawnunits? + chess knowledge
**Vincent Diepeveen***19:03:09 10/25/02*

This page took 0 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.