Search found 2332 matches

by Michael Sherwin
Fri Jun 12, 2020 2:26 pm
Forum: Computer Chess Club: General Topics
Topic: New RomiChess, soon
Replies: 31
Views: 3366

Re: New RomiChess, soon

Hello Michael, Just curious, how is the new version of Romi coming along? It is eagerly awaited! :D -best wishes, Carl There comes a point in someone's life as they get older if they are honest that they must admit that they are just not able to do what they were once able to do. I think that I rea...
by Michael Sherwin
Fri Jun 12, 2020 12:56 am
Forum: Computer Chess Club: General Topics
Topic: New RomiChess, soon
Replies: 31
Views: 3366

Re: New RomiChess, soon

Here is analysis of Fat Fritz 1.1 https://share.chessbase.com/SharedGames/game/?p=MK537QVcmtW2D6fVZhycy5GPKiAXDiXy72BKqOScvm3kbnjaejRBOjAc4yJEdHuS Looked. The initial sacrifice was not the best, obviously. But, nonetheless it was very interesting play by a 2400 CCRL engine. Both engines did find qu...
by Michael Sherwin
Sat Jun 06, 2020 8:41 am
Forum: Computer Chess Club: General Topics
Topic: Banksia GUI released
Replies: 832
Views: 93252

Re: Banksia GUI released

Has anyone tried running RomiChess under Banksia? It was in a knockout tournament I ran the other day using the console app not the GUI and ... it won :D I'm not a winboard expert so it may be something silly going on that I don't follow. First of all it apparently forced Ethereal 11 and Ethereal 1...
by Michael Sherwin
Mon May 18, 2020 3:14 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: sort every moves or pickNext
Replies: 14
Views: 1132

Re: sort every moves or pickNext

What I do in RomiChess is generate all the bitboards first without spinning them into a move list. That checks for legality since Romi uses pseudo legal move generation. Next I play the hash move and the check for validity is as simple as checking the bit in the bitboard for the piece. Romi does not...
by Michael Sherwin
Sat May 09, 2020 11:37 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Quick history move
Replies: 6
Views: 730

Re: Quick history move

Sounds inefficient because of all the moves in the hash that do not exist at any given time. I think that two history tables, one of long period and one of short period, might be a good idea.
by Michael Sherwin
Mon May 04, 2020 3:57 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: I think its vapor (hard)ware
Replies: 3
Views: 870

Re: I think its vapor (hard)ware

Looks like a computer generated image. It probably does not even exist. My first impression is it is some kind of scam. But, who knows.
by Michael Sherwin
Mon May 04, 2020 3:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Paradigm's first mile marker
Replies: 0
Views: 585

Paradigm's first mile marker

It is able to be compiled without error or warning. It is not a chess engine yet. All it can do right now is make a legal list of moves with material only scores (of course all scores are zero) in the original position. Since this is a new thread it works by generating one move at a time and then ca...
by Michael Sherwin
Wed Apr 29, 2020 2:39 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty 25.6 search stability
Replies: 39
Views: 5593

Re: Crafty 25.6 search stability

Your questions at the top. Hash table is the problem. 1, 2 or more threads can store and read the same position. That's called a race condition. If you synchronize there it becomes a huge bottleneck. There are other things that need to be read and written by different threads at the same time. Pawn...
by Michael Sherwin
Sat Apr 25, 2020 8:50 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 52
Views: 5769

Re: Simplifying code

Please tell, how does one achieve good move ordering without a list of moves to order? If you have a hash table hit with hash move, but insufficient depth draft, you don't need to generate moves because it will probably (90% - 95%) be a beta cut-off. I just verify the complete move legality of the ...
by Michael Sherwin
Sat Apr 25, 2020 8:43 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 52
Views: 5769

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 ...