TalkChess.com

In Andscacs I tried to do most things in my own way, and once I understood about something better I tried to implement it in my own way also. For example the first move generator was scanning square after square until it found a piece or went out of the board, with a simple For. Only much later I t...

As some sort of research and educational project I've implemented the move generator of micro-Max engine by Harm Geert Muller in NASM assembly in order to finally get complete understanding of what's going on inside there. I really doubt somebody is going to get interested, but nevertheless... Here'...

Not really for mailbox is used to prevent piece going offboard. '/' this char on the right edge of the board will prevent only sliding pieces moves, but knights would jump over that to another rank, so I believe it's not to be claimed as mailbox. Unless you meant 8x8 representation, well, probably, ...

I'm familiar with bitboards (wrote 'plain' bitboard movegen once... ), I've just come with an idea. Being a big fan of 0x88 system (I did 3 engines using it, they are raw, but still) I wondered - 0x88 is just about indexing the board rather than using the amount of extra 8x8 squares on the right, so...

I used to start writing a new chess engine with parse fen routine. It's absolutely ok in case writing it in C, but recently I've switched to NASM assembly which lead to significant grow of code size, so I came up with an idea which might have look pretty weird at a glance, but I still believe it has...

Vivien, it's I'm so happy people are gaining interest in minimalist chess, I've found your minic engine idea to be very interesting. Unfortunately it's not always easy to define the true goals while writing a minimalist chess, I mean what kind of minimalism is about to prefer - minimalist RAM usage/...

Hi again, guys! I've started to learn NASM assembly and currently rewriting my engine in it! Many of you would probably consider such an idea to be completely weird because using modern C/C++ optimization flags would probably give as fast performance as assembly would give, but it was my childhood d...

http://wbec-ridderkerk.nl/html/UCIProtocol.html Did you mean this?

Mr. Muller, I have a move ordering related question. In genmoves() I make() and unmake() each move to give it a score via eval(). Later in Search() I order the moves by score. The node count falls from 490000+ to 4500+ nodes which seems to be a good result. Does this technique allow to abandon mvv_l...

It looks great, I like stuff like that. Did you consider to use unicode chars for representing chess pieces? It looks pretty cool in the console, I use them in print board function when debugging my engines