17

What you're looking for is software/website that allows you to load or import PGN files. The Lichess Analysis board, for example, supports exactly what you want: https://lichess.org/analysis -- below the board is a text area labelled "PGN", paste your moves in there and hit "Import PGN", and you can then navigate through your game. All ...


10

I don't know of a single program that does all that. I do it myself with following steps. I save most of my games in a pgn file. The interesting ones, esp. my losses, are analyzed by Stockfish. The "blunder threshold" is your choice, typically 3 - 5 pawns or more. With Notepad++ text editor I enter the FEN of the position in a pgn file, of course ...


7

Lichess has the "learn from your mistakes" feature, which can be used to play your significantly bad moves in a game as a puzzle. From your profile, select a variant/time control on the left, then click "view the games" in the top right. Click on a game, go to the analysis board, and at the bottom, in the "computer analysis" ...


7

FIDE publish a list of such programs here. Currently there are 8 programs on the list varying in price from completely free (STOP), free on Linux (Vega), partially free (ChessManager) to 150 euros (Swiss Manager). Program - Author Vega - Luigi Forlano (ITA) SwissSys - Thad Suits (USA) SwissMaster - Royal Dutch Chess Federation (NED) Swiss-Manager - Heinz ...


6

As Brian mentioned, CQL (Chess Query Language) is the most capable tool for the job. The current version of CQL at the time of this writing is 6.0.5 and the current website is http://www.gadycosteff.com/cql/. The site provides lots of examples and comprehensive documentation. Below are queries that will find games matching your three examples to give you ...


6

[1] Your understanding is correct, with one slight adjustment. Instead of thinking about it as "King on a1, Pawn on a2", you should think of it as two things: "King on a1, Friendly Pawn on a2", and "King on a1, Enemy Pawn on a2". The input layer knows the colors of the pieces. Note that I do not say White/Black, but Friendly/...


6

In addition to the other answers, there are a few sites to consider. These include annotation and comment features as mentioned by the OP. Listudy.org Upload a PGN and then you play the computer interactively. You play moves from your repertoire and the computer plays the opponent moves. This is also open source. ChessTempo.com Similar functionality in the &...


5

Check out https://blitztactics.com/ which is pretty much the same thing. It even has a few other modes.


5

In theory, you need 10,000 hours of (good) study to master any subject. A four year goal would require about seven hours per day. GM Donaldson, quoted some time ago, studies five hours a day before a tournament just to stay at his level. The most effective improvement is in tactics. Tactics is said to be 99% of chess (various authors) and most games are ...


5

I found this reddit post which has two comments which answer this question. link https://tactics.bitcrafter.net/ This is essentially exactly what I was looking for and bonus points in that I think I found their github that has their code which seems shockingly simple link I made something like that, both open source http://chesstacticsgenerator.vitomd.com/ ...


4

For queens, bishops and rooks moving from square A to square B there is only one way that move can be made and all the squares in between must be empty for that move to be legal. For a knight moving from square A to square there are generally two ways but that is irrelevant because knights can jump over pieces in the way. For castling there is only one way ...


4

Yes, endgame tablebases are calculated by brute force. That's why we only have complete 7-men tablebases today (which were published in 2012). When stockfish finds a mate with more pieces than stockfish has calculated until only 7 men are on the board and the tablebases give stockfish the solution for the rest.


4

There is already an offline program which has a lot of my ideas implemented: http://www.chesspositiontrainer.com/index.php/en/features But there is no good online tool which comes even close to that, let alone surpassing the linked offline tool. And I think an online tool, which stores the individual repertoire databases on a serve, would be much better, ...


3

Lichess provides its source code, so it should be easy to use this code, with minor modifications, with any number of scripts. Most engines already come with a computer analysis, so writing a program to feed in every position from a pgn file is easily done. The problem with both is programming skills. I thought that I could do this, but I gave up even ...


3

No. It's a matter of taste how the knight travels from the start square to the end square, but nothing is written on how it gets to the final square. The same for castling, of how the rook arrives at the destination square, since it has to get there by moving past the king that's just made a two square move.


3

It sounds like what you want is a free database which is not copyrighted and not licensed. The best one I know of that fits that bill is Caissabase. It is a free download with no license and this explicit statement of no copyright: Legal/Copyright Where I live facts are not copyrightable, Chess moves played in a game are facts. You'll notice there are no ...


3

I don´t think chess games are copyrightable, as they´re just a collection of facts, so games of chess are not considered by the courts to be anyone´s property. I would say that you are free to comercially reproduce a game, as long it´s just that, the moves played in that game. To put in perspective, if you took a screenshot of the result of a videogame, for ...


3

If you are looking for an easy-to-use, FIDE-approved online platform, take a look at ChessManager.


3

https://decodechess.com/ advertises this kind of service but I doubt if it's really useful.


3

Chess Query Language operates on PGN files of games and does what you want as well as much more powerful stuff. It is a free download. There are lots of examples to get you started here.


3

LiChess or Chess.com have apps accessible to Android, in which you can find an analysis board and study from there. You can save the boards as well until further use. Plus, there are a lot of features, such as finishing game with computer, analysis from engine etc.


3

My own website has two pages where you can paste chess notation and view it on an interactive chessboard and then save it as a link to be bookmarked or generate an animated image showing the whole game from start to end: (1) old: https://www.apronus.com/chess/pgnviewer/ (2) new: https://www.apronus.com/chess/puzzle/editor.php (PGN import tab)


2

I don't understand what you meant by pgn split, but I once purchased a chess pgn book and it has all the games (312) in one pgn file. Now I need to split it into each chapter with exactly 12 games each. I searched over the internet and didn't manage to find anything helpful. So I wrote a python program to divide it into separate files. import os name = '...


2

Chess Tiger Pro (for iOS). Link to App Store


2

This depends heavily on how complicated your evaluation function is. The more complicated it is, the more time is necessary to "calculate" (more accurate word here is evaluate) one position. That's why the current neural network engines calculate three orders of magnitude fewer positions per second than traditional engines. In the same way, engine ...


2

You could try PGN ChessBook Which is a free app that has some good automatic blunder-check / game-annotation features. It can find blunders, then automatically annotate the game by inserting variations and (optionally) adding comments to the blunder moves, which can then be printed out, as described in this video How to find and print out game blunders using ...


2

As the version of python-chess I'm running doesn't support chess.uci, here's what worked for me. engine = chess.engine.SimpleEngine.popen_uci("/path/to/engine.exe") board = chess.Board() info = engine.analyse(board, chess.engine.Limit(time=10),multipv=20)) info is a list of InfoDict objects, each with the keys "pv" and "score", ...


2

I would expect that it is a good bit easier to write a program that is good at detecting dead positions than to write a program that plays chess well. A simple strategy may be to play out a large number of games randomly to the end starting from the position given. If the position is dead, none of the playouts will have a result different from draw. If on ...


Only top voted, non community-wiki answers of a minimum length are eligible