AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
Free 30 days.
Go from Code to Production URL in Seconds
Cloud Run deploys apps in any language instantly. Scales to zero. Pay only when code runs.
Skip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
"Shane's Chess Information Database" is a huge chess toolkit with extensive database, analysis and chess-playing features.
Scid vs. PC is a usability and bug-fix fork of Scid. It has many interface fixes and improvements, and is fully compatible with Scid's .si4 databases. New features include a rewritten Gamelist, Computer Tournament, and FICS, Tree, Book and Graph improvements.
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle.
This project is related to my other projects located at sourceforge as well:
https://sourceforge.net/projects/path-finder-qt/
https://sourceforge.net/projects/shortest-path-graph-a-star/
For detail of A* algorithm see wiki page:
https://en.wikipedia.org/wiki/A*_search_algorithm