Open tissatussa opened 1 year ago
Sorry for the long response, I'm glad you like it!
can you paint yours ? could you explain some more about "the search's perceived worth of each piece" ? did you implement this function in any way ? what is meant by 'Piece value' ? is the 'worth' like a 'static evaluation' value ?
The way this works is for the position I run search up to some nodes. Then iteratively I remove each piece (except the king), and run search again, and compare the score to the original score of the position. The difference of these search results is what I called "search's perceived worth of each piece", but maybe that's not accurate.
btw. i can not change the value -69, eg. when i run 'ds nodes=50000000' or so .. Ah probably bad documentation. The way you would do this is
ds 50000000
.
Let me know if you have more questions about this. It's honestly just something I did on a whim.
did you implement this function in any way ? maybe this ds command is just for private testing
just curious ..
i will test ds 50000000
later.
.. I'm glad you like it!
i like to think out-of-the-box .. many chess engine programmers follow the well-known methods and steps to create some own engine, but i noticed many aren't good at playing chess in practice .. it seems in general they are mainly focussed on statistics of self-play-games while adjusting their parameters .. i want to elaborate on this .. concerning all this, today i posted some bug at https://github.com/scs-ben/pygone/issues/4 , adding some interesting questions about engine design, esp. time management .. can you scetch your view ?
today i posted some bug at https://github.com/scs-ben/pygone/issues/4 , adding some interesting questions about engine design, esp. time management .. can you scetch your view ?
I was too late, and I think you were as well with this comment, that issue seems to be resolved
lately i stumbled upon your chess engine project and i found the intriguing option 'ds' .. my attention was triggered by the info of the help command :
here's the output of a typical Kings Gambit opening position :
the statistics below the diagram are same as with the 'd' command, except the 'Search' value.
all this output is rather mysterious to me .. maybe this ds command is just for private testing .. anyhow, i like it, but i don't understand yet .. the idea "run-a-search-for-each-piece-being-removed" is a nifty concept .. i once thought about it too, being curious what the outcome will be, 'cause there must be logic in it .. eg. those (changed) values could fit some 64-magic-square configuration or some other logical count mechanism, involving the movement rules and .. best move(s) !?
i hope you get my picture.
can you paint yours ? could you explain some more about "the search's perceived worth of each piece" ? did you implement this function in any way ? what is meant by 'Piece value' ? is the 'worth' like a 'static evaluation' value ? what is 'Phase' ? btw. i can not change the value -69, eg. when i run 'ds nodes=50000000' or so ..
the game of chess is wonderful for programmers and their logic, 'cause we have mate-in-# and many designed test positions !? i've always wanted to meet some programmer thinking outside the box, with time and passion to explore new grounds in logic. myself, i did many experiments with ideas regarding "managing chess values", nothing serious yet though, and only Python and JS) ..
i await your feedback, i'm really curious !