chess-2
Chess engine (by paulsonkoly)
pixel-chess
A simple Chess engine written in JavaScript hooked up to a retro front-end for play. ♞ (by will-lamerton)
chess-2 | pixel-chess | |
---|---|---|
2 | 2 | |
5 | 9 | |
- | - | |
2.5 | 10.0 | |
about 1 year ago | over 1 year ago | |
C | JavaScript | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
chess-2
Posts with mentions or reviews of chess-2.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-11.
-
How does Depth actually work?
Yes, that is true. One can use NNs in either evaluation or heuristics or both - to my understanding, I haven't researched this that much. But yes what you say would fall under the heuristics category that mainly drives move ordering, better looking moves first. As the search is ultimately a depth first in basically every engine. If you are curious, allow me the shameless plug, you can check out my engine @ https://github.com/phaul/chess-2 I'm happy to answer you anything else about the engine, I love talking about this stuff :)
-
chess review
If you decide to implement all rules ( en-passant / castle etc ) I recommend implementing a simple recursive function known by chess engines as perft. (https://www.chessprogramming.org/Perft#:\~:text=Perft%20is%20mostly%20for%20debugging,functions%20work%20correctly%20or%20not.) Running perft on different positions to a certain depth and then comparing your numbers against perft in stockfish etc is really helpful shaking bugs out.For my pet project engine I wrote some shell script that is supposed to debug and find positions where the engine has a bug in the move generator https://github.com/phaul/chess-2/blob/main/debug.sh
pixel-chess
Posts with mentions or reviews of pixel-chess.
We have used some of these posts to build our list of alternatives
and similar projects.
-
I wrote a Chess Engine as a side project in 2-weeks!
Given a year, wow, loads. I would love to build in some sort of machine learning to aid its ability to play. This would take time though. There's a ton more. I added a roadmap here of things I'd like to add. What do you think? I also wrote about the project in general etc over on the GitHub repo. Again, interested in your thoughts :)
-
Help me improve my JavaScript Chess engine ♞
I wrote this Chess engine in JavaScript over the course of 2 weeks having never written one before. The GitHub repo is here: https://github.com/will-lamerton/pixel-chess and you can play it over at https://chess.barr.media/.
What are some alternatives?
When comparing chess-2 and pixel-chess you can also consider the following projects:
chess
A.C.A.S - Moved to psyyke.github.io
JavaScriptChess - JavaScript (ECMAScript) Chess Game Engine with browser based wrapper page
StockNemo - A C# Chess Engine Finding Good Moves.
betafish - A chess engine and AI move finder written in Javascript. Beats Stockfish level 6 on Lichess.