Search found 1130 matches

by Ras
Wed Oct 28, 2020 6:52 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Make engine stop repeating moves in a clearly won position
Replies: 34
Views: 791

Re: Make engine stop repeating moves in a clearly won position

So you mean to skip the move ("continue" the loop as you do if make() returns that the move is not legal) No, I meant that you usually have something like this in your node loop: for all moves in the node: make_move t = recursion(...) unmake_move if (t > alpha) do_something if (t >= beta) do_cutoff...
by Ras
Wed Oct 28, 2020 3:30 pm
Forum: Computer Chess Club: General Topics
Topic: Question to Shut Ctf Down posters
Replies: 75
Views: 2066

Re: Question to Shut Ctf Down posters

Guenther wrote:
Wed Oct 28, 2020 1:06 pm
Well, but he voted for shutdown in this 'survey'.
So did I, but since it looks like the shutdown poll is being ignored, the backup option is implementing SHID as CTF moderator team, which in turn requires three mods agreeing on that policy - and of course, them being elected in the CTF election.
by Ras
Wed Oct 28, 2020 3:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Make engine stop repeating moves in a clearly won position
Replies: 34
Views: 791

Re: Make engine stop repeating moves in a clearly won position

PS: If I put the call to is_repetition directly after make() (in the move loop), the engine instantly returns with minus infinity, That's probably because you shouldn't return 0 as value from the loop at that point - only skip the usual recursive evaluation and use 0 as "value for this move". Means...
by Ras
Tue Oct 27, 2020 10:31 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Make engine stop repeating moves in a clearly won position
Replies: 34
Views: 791

Re: Make engine stop repeating moves in a clearly won position

mar wrote:
Tue Oct 27, 2020 10:05 pm
It should be obvious that captures are irreversible and thus reset move history, but somehow you didn't quote this back.
Indeed, I overlooked that, and you're right. Do you have numbers how often the repetition detection in QS actually does detect a repetition? Because I think it should be about 0.
by Ras
Tue Oct 27, 2020 9:45 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Make engine stop repeating moves in a clearly won position
Replies: 34
Views: 791

Re: Make engine stop repeating moves in a clearly won position

as for performance, I don't think that probing a rep hash/iterating history list in each qs node would be something you could even measure. Given that by far most nodes are QS nodes, and that you can have positions where you don't have irreversible moves for quite some time, I'm not sure whether it...
by Ras
Tue Oct 27, 2020 9:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Make engine stop repeating moves in a clearly won position
Replies: 34
Views: 791

Re: Make engine stop repeating moves in a clearly won position

Could this be the problem? I had this check just after "if depth == 0", so it would make the move, possibly hit depth 0, go into QSEARCH, and return a score from there, and thus never reach the repetition check. That should auto-correct once the main search depth catches it, but it might lead to PV...
by Ras
Tue Oct 27, 2020 8:56 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Make engine stop repeating moves in a clearly won position
Replies: 34
Views: 791

Re: Make engine stop repeating moves in a clearly won position

50 move rule draw (be careful though to score the draw properly here, if you are one ply off, terrible things may happen) And keep in mind that mate right on the 50th move trumps the draw even if the mate move is neither a capture nor a pawn move. well, why not do this inside qsearch? Because QS sh...
by Ras
Mon Oct 26, 2020 10:18 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Progress on Rustic
Replies: 99
Views: 8332

Re: Progress on Rustic

What I meant by guessing was that it's impossible to know if you're going to finish an iteration or not That's right. But you can know when it will be unlikely, and that's e.g. if you have already used up 50% of the time that you had allocated for this move before starting the search. Then you can ...
by Ras
Mon Oct 26, 2020 8:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Progress on Rustic
Replies: 99
Views: 8332

Re: Progress on Rustic

Why taking the guess approach at all? You can just allocate a maximum thinking time beforehand. That's either a fixed move time, or some logic based on remaining time, increment, game phase and other factors. During search, you query the system time every so many nodes, something like 500 or so will...
by Ras
Sat Oct 24, 2020 2:20 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Progress on Rustic
Replies: 99
Views: 8332

Re: Progress on Rustic

It expects, and then ignores, "bestmove". Which I'd send immediately with "bestmove 0000". Of course, it might trip up the GUI if it discards this and starts only scanning for "bestmove" after it has sent "stop". I could of course also delay the "bestmove 0000" in case of "go infinite" so that the ...