Should not the Draw rate be higher here in the above position?
"Good decisions come from experience, and experience comes from bad decisions."
__________________________________________________________________
Ted Summers
Yes, funny how if I make white to move there is no problem.
[d]8/5k1p/5q2/8/1R6/6P1/5P2/6K1 w - - 0 0
"Good decisions come from experience, and experience comes from bad decisions."
__________________________________________________________________
Ted Summers
I don't like this feature and most probably won't use it....
_No one can hit as hard as life.But it ain’t about how hard you can hit.It’s about how hard you can get hit and keep moving forward.How much you can take and keep moving forward….
shiv wrote:In this case, the fortress plan is hard for the computer to work out if it does not have access to tablebases.
It did have acess to Tablebases.
"Good decisions come from experience, and experience comes from bad decisions."
__________________________________________________________________
Ted Summers
Should not the Draw rate be higher here in the above position?
This interests me.
I always thought Monte Carlo technique wouldn't apply in chess (more so for learning from a no-knowledge base) because so many games would end up shuffle shuffle aimlessly and be drawn, but take way too many moves to detect. ie too many games wouldn't terminate.
Monte Carlo is a way to learn for Backgammon, very effective, it produces a GM strength program after 500,000 games or so via neural net, I did that for backgammon some years ago, but ran into the never ending games problem when similar idea tried for chess. (Backgammon essentially is a one-way street, eventually all pieces exit the board and game is over by definition).
Do you notice this game incomplete problem for the Rybka Monte Carlo-ing? Is it mentioned in the readme, or?