BigLion 2.23i - RDChess 3.23 1-0 43
RDChess 3.23 - BigLion 2.23i 0-1 67 The Lion at 1! (but Waster have still 2 games to go!)
Hi Rudolf,Hi Matthias,BigLion 2.23i - RDChess 3.23 1-0 43
RDChess 3.23 - BigLion 2.23i 0-1 67 The Lion at 1! (but Waster have still 2 games to go!)
congratulations to your wins and your strong engine!
RDChess is too weak and still plays horrible blunder moves.
I finally decided to stop work on Delphi RDChess V3.xx and have already begun work on a new engine, built up from the scratch. The GUI is written in Visual Studio C#, the search engine will be a C++ DLL.
I am convinced my second chess program will be stronger than my first one, how much I do not know.
I think I will need at least half a year for programming until releasing a first beta version and one more half year until relasing it under the name RDChess V4.0.
Rudolf
RDChess is stronger than BigLion at Blitz.
When the time control gets long, RDChess indeed messes a bit.
A BigLion beta once behaved similarly and I traced it to history heuristics
values growing large enough at long time controls to even override good
captures in move ordering.
It really depends on how your move ordering works. In previous versions of my engine at longer time controls I've seen it score some history moves above winning captures, this can really screw up your move ordering and branch factor. It wouldn't cause a blunder so maybe it isn't so bad but it can be a problem. I might still have some problems and one of the things I plan to do is re-write my move ordering and move selections routines to completely prevent anything like this. My engine has some other problems as well like a hash-bug maybe, and my plan is to debug what I have before changing much.Hi Rudolf,
RDChess is stronger than BigLion at Blitz.
When the time control gets long, RDChess indeed messes a bit.
A BigLion beta once behaved similarly and I traced it to history heuristics
values growing large enough at long time controls to even override good
captures in move ordering.
This is not a real big problem.
The real big problem is when the engine make stupid blunders at long time control and based on my understanding it is exactly the case with Rdchess.
Uri
Hi Rudolf,
RDChess is stronger than BigLion at Blitz.
When the time control gets long, RDChess indeed messes a bit.
A BigLion beta once behaved similarly and I traced it to history heuristics
values growing large enough at long time controls to even override good
captures in move ordering.
This is not a real big problem.
The real big problem is when the engine make stupid blunders at long time control and based on my understanding it is exactly the case with Rdchess.
Uri
My point is that the problem of RDchess is stupid blunders and not bad order of moves at long time control.In the case I explained, BigLion's move ordering used to drop to below 50% as captures were considered bad everywhere in the tree and my PVS would sometimesHi Rudolf,
RDChess is stronger than BigLion at Blitz.
When the time control gets long, RDChess indeed messes a bit.
A BigLion beta once behaved similarly and I traced it to history heuristics
values growing large enough at long time controls to even override good
captures in move ordering.
This is not a real big problem.
The real big problem is when the engine make stupid blunders at long time control and based on my understanding it is exactly the case with Rdchess.
Uri
need several minutes to see good moves in the virtually unsorted tree.
Hello Uri,My point is that the problem of RDchess is stupid blunders and not bad order of moves at long time control.The real big problem is when the engine make stupid blunders at long time control and based on my understanding it is exactly the case with Rdchess.
Uri
It probably would have been a lot more gentle if he had said:Hello Uri,My point is that the problem of RDchess is stupid blunders and not bad order of moves at long time control.The real big problem is when the engine make stupid blunders at long time control and based on my understanding it is exactly the case with Rdchess.
Uri
I am going to assume that you meant no harm but your particular method of expression could be mistaken for contempt. I do not believe that you intend to do so BUT you seem to convey the idea in your two posts.
The mere repitition of the same concept in the later post does not in my opinion, yield any more useful data. I suggest that you take a moment and consider the effect that your posts may have on the casual reader.
Of course there is always the possibility that no-one minds but I am just expressing my opinion as a member of this Forum.
That the program may or not make elementary errors is surely subject to rational analysis. The repeated use of the word stupid - particularly when blunder adequately conveys the idea - adds an unwelcome dimension to the post.
Feel free to disagree of course.
Later.
I accept the suggestion not to use the word stupid but my guess is that the problem is not in the evaluation but in bugs that bound checkers can find.It probably would have been a lot more gentle if he had said:Hello Uri,My point is that the problem of RDchess is stupid blunders and not bad order of moves at long time control.The real big problem is when the engine make stupid blunders at long time control and based on my understanding it is exactly the case with Rdchess.
Uri
I am going to assume that you meant no harm but your particular method of expression could be mistaken for contempt. I do not believe that you intend to do so BUT you seem to convey the idea in your two posts.
The mere repitition of the same concept in the later post does not in my opinion, yield any more useful data. I suggest that you take a moment and consider the effect that your posts may have on the casual reader.
Of course there is always the possibility that no-one minds but I am just expressing my opinion as a member of this Forum.
That the program may or not make elementary errors is surely subject to rational analysis. The repeated use of the word stupid - particularly when blunder adequately conveys the idea - adds an unwelcome dimension to the post.
Feel free to disagree of course.
Later.
"The problem is in the evaluation, and not in the search or move ordering."
Conveys the same information but does not taste as salty.
IMO-YMMV.
This is true, but the problem is not very difficult to fix. Whenever you increase an entryIt really depends on how your move ordering works. In previous versions of my engine at longer time controls I've seen it score some history moves above winning captures, this can really screw up your move ordering and branch factor. It wouldn't cause a blunder so maybe it isn't so bad but it can be a problem.Hi Rudolf,
RDChess is stronger than BigLion at Blitz.
When the time control gets long, RDChess indeed messes a bit.
A BigLion beta once behaved similarly and I traced it to history heuristics
values growing large enough at long time controls to even override good
captures in move ordering.
This is not a real big problem.
Hi Albert,Hi!
As usual it is getting exciting when the end of the division is getting closer. I'm following the former main opponents for Sharper, to see which one is also going to step up to the 4th division. I can't wait for Sharper to start playing again.
/Albert
No engines can stop Waster from being the Champ down here in Division 5.Waster needs to win both the games in hand to sneak ahead again,
Ahhh, that's a good one Tord. I've clamped mine to the limit, but is an obviously better solution. Thanks!This is true, but the problem is not very difficult to fix. Whenever you increase an entryIt really depends on how your move ordering works. In previous versions of my engine at longer time controls I've seen it score some history moves above winning captures, this can really screw up your move ordering and branch factor. It wouldn't cause a blunder so maybe it isn't so bad but it can be a problem.Hi Rudolf,
RDChess is stronger than BigLion at Blitz.
When the time control gets long, RDChess indeed messes a bit.
A BigLion beta once behaved similarly and I traced it to history heuristics
values growing large enough at long time controls to even override good
captures in move ordering.
This is not a real big problem.
in your history table, you check whether the new value of the entry exceeds some
threshold. If it does, loop through your history table and divide all entries by 2.
Doesnt this mean Waster is almost as near to TSCP than DanChessNo engines can stop Waster from being the Champ down here in Division 5.Waster needs to win both the games in hand to sneak ahead again,
I hope that your engine is strong enough to prevent some modified tscp from being the champion.
see http://www.talkchess.com/forums/1/message.html?353276
Uri
I got the impression based on the post that the similiarity between tscp and Waster is bigger than the similiarity between Danchess and Crafty.Doesnt this mean Waster is almost as near to TSCP than DanChessNo engines can stop Waster from being the Champ down here in Division 5.Waster needs to win both the games in hand to sneak ahead again,
I hope that your engine is strong enough to prevent some modified tscp from being the champion.
see http://www.talkchess.com/forums/1/message.html?353276
Uri
was to Crafty according to Bob Hyatt? (not Dann)
This is not meant as an offense, but I think it would be good
if that issue could be enlightened a bit for non programmers.
Regards,
Güntehr
Hmmm, thanks for the link Uri. I don't read CCC enough to see everything there. Time to start working on my engine again since it is still getting kicked around by TSCP.No engines can stop Waster from being the Champ down here in Division 5.Waster needs to win both the games in hand to sneak ahead again,
I hope that your engine is strong enough to prevent some modified tscp from being the champion.
see http://www.talkchess.com/forums/1/message.html?353276
Uri
Return to Archive (Old Parsimony Forum)
Users browsing this forum: No registered users and 25 guests