TalkChess.com

Lisp is a great language but many implementations seem to have to trade off performance for functionality. Have you looked into Lisp dialects intended fast execution such as PreScheme?

Aser Huerga wrote:Hello Andrés,

what can you say about these tweaks you are testing? I plan to join Dirty to a tournament about spanish and latin engines in the near future, and I ask myself if there will be another Dirty version soon...

Regards.

Perhaps there will be one this weekend.

mathmoi wrote:Hi,

I have a simple question. In a PVS search, in a PV node, if one of the children after the first fail high, I have to search it again with a non-null window. When I do this research, is this node a PV node?

Thanks,

MP

Yes. http://chessprogramming.wikispaces.com/Node+Types

michiguel wrote:I am done writing the compressor for the endgame tablebases (tbcp)...

Are there any good resources describing LZMA? I realize that there's already some C code, but I don't think it will be that useful to learn the algorithm.

This is similar to the results I obtained for material-imbalance self-play of Fairy-Max, and an experiment I read about with pawn-odds games for Rybka 1-min games. The latter found ~74% score advantage, while I found 68%. But In my measurements I averaged out the white advantage, while the Rybka re...

http://chessprogramming.wikispaces.com/Pawn+Advantage%2C+Win+Percentage%2C+and+ELO That is an interesting graph. Odd that they show a model fitted for K=4 when the tails would be better represented with K=5. Is there some empirical reason not to vary K for a best fit solution? Regards, Martin Brown...

Gerd Isenberg wrote:I have a question about the definition of linear versus nonlinear evaluation.

Is there any advantage to having a linear vs non-linear evaluation function? Would it make analyzing an evaluation function significantly easier if it was linear?

PSTs would be nonlinear because PST[sq1+sq2] != PST[sq1] + PST[sq2] I guess PSTs are linear if you define your function differently (with 64 discrete inputs instead of one). For example take a knight position PST: PSTeval(ispieceonsq1 , ispieceonsq2, ispieceonsq3... ispieceonsq64) where ispieceonsq...

I have a question about the definition of linear versus nonlinear evaluation. Linear eval is the dot-product of features and weights. Assuming a passed pawn piece-square table contains for instance the square (x*x) of baserank distance (x), is this still linear evaluation? Is nonlinear eval necessa...

I've recently learnt about memory barriers and am rather confused about what they are meant to do and how they are different from what the volatile keyword does. From my understanding: - A read barrier makes sure all reads operations after the barrier happen after read operations before the barrier....