Search found 3854 matches

by Henk
Sat Apr 25, 2020 10:13 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

The nodes near the root need not care much about efficiency of move ordering. I don't think so. True, there are only few nodes near root, but they have the largest search trees beneath them. Then one can increase reduction to make trees smaller as much as you like. Of course then you get worse move...
by Henk
Sat Apr 25, 2020 9:27 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

I am quite sure that hash move first only ordering does not make for a very good move ordering scheme. Correct because most of the time, at least in the middlegame, there won't be a hash hit. But I guess you could also implement MVV-LVA in some clever way so that the order of move generation would ...
by Henk
Sat Apr 25, 2020 9:03 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Introduction and new rookie engine in progress
Replies: 6
Views: 1297

Re: Introduction and new rookie engine in progress

Prolog that's fun. I thought about writing an engine in XSLT. But only thinking.
by Henk
Sat Apr 25, 2020 8:49 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

I create a move priority queue on each node if it doesn't stand pat. On every node of the search tree? Do you have really huge standpat margins lower in the tree? How can queen sacrifices ever be seen? A priority queue can mean many things. I assume that you generate pawns_capture_queens first and ...
by Henk
Sat Apr 25, 2020 8:28 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

I create a move priority queue on each node when not leaf node.
by Henk
Fri Apr 24, 2020 7:13 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Noise Bug
Replies: 2
Views: 661

Re: Noise Bug

I doubt code posted is correct. So I chose for workaround. Less worries.
by Henk
Fri Apr 24, 2020 7:11 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

Henk wrote:
Fri Apr 24, 2020 12:54 pm
Can't copy position efficiently. Too many bytes.
Maybe only 32 bytes needed. So maybe not that inefficient.
But too late I already implemented my snapshot solution.
by Henk
Fri Apr 24, 2020 1:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

That's too much code. I simply Board = moves + i; And nothing else. There is no simpler way to do it. copy+make or what's the correct terminology. Don't understand. What is "+ i". "ï" is next move? Then each time you need the current position you have to reconstruct it from the moves. Too slow. It'...
by Henk
Fri Apr 24, 2020 12:54 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

Can't copy position efficiently. Too many bytes.
by Henk
Fri Apr 24, 2020 12:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 90
Views: 11068

Re: Simplifying code

That's too much code. I simply Board = moves + i; And nothing else. There is no simpler way to do it. copy+make or what's the correct terminology. Don't understand. What is "+ i". "ï" is next move? Then each time you need the current position you have to reconstruct it from the moves. Too slow.