This commit is contained in:
Miloslav Ciz 2024-09-18 20:37:15 +02:00
parent d2cc338141
commit 8604bfc7c0
33 changed files with 1866 additions and 1824 deletions

View file

@ -76,6 +76,8 @@ Playing strength is not the only possible measure of chess engine quality, of co
{ Nanochess is actually pretty strong, in my testing it easily beat [smallchesslib](smallchesslib.md) Q_Q ~drummyfish }
Visualizing chess state space can be [interesting](interesting.md). Here is one idea: draw the board with all squares black except the ones with men which can be moved -- color these white. Now [recursively](recursion.md) replace each square with a similar picture: the black ones will stay black, the white ones will be replaced by boards where only the square to which the man in question can be moved will be colored white. And so on until certain depth. Of course the image will be getting very large quickly and will also be quite black, so some kind of improvement may be employed: for example make the black square as small as possible. Additional fanciness can also be added, e.g. maybe don't redraw the squares but just keep brightening them or whatever. Any chess game played can then be visualized as zooming into this large image. This kind of visualization may also be applied to any other game which is played on a board by "clicking" squares, i.e. also tic tac toe, go etc.
### Programming Chess
NOTE: our [smallchesslib](smallchesslib.md)/smolchess engine is very simple, educational and can hopefully serve you as a nice study tool to start with :)