Spartan

Home * Engines * Spartan

[ SPARTAN-101 Diagram [1] Spartan,

an UCI compliant open source chess engine by Christian Daley, written in C and distributed under the GNU General Public License, first released in April 2016 as successor of JFresh [2]. As a pure bitboard engine, Spartan applies Matt Taylor’s folding trick to scan bits [3], and Brian Kernighan’s way to count bits [4]. In calculating king passer tropism in evaluation, Spartan uses the Euclidean distance between king and passer squares with double arithmetic due to C standard library square root (double sqrt(double)) [5] [6] of the sum of squares of rank difference and file difference, which is quite expensive. Recommended is looking up the Chebyshev distance or Manhattan distance for that purpose.

Board Representation

Evaluation

Misc

See also

Forum Posts

Chess Engine

Misc

References

  1. SPARTAN-101 (Shuttle Pointed Autonomous Research Tool for Astronomy) carrier module of STS-51-G, the 18th flight of NASA’s Space Shuttle program, and the fifth flight of Space Shuttle Discovery, June 17-24, 1985, NASA image, SPARTAN – Wikipedia.de (German), Wikimedia Commons
  2. New UCI engine: Spartan by CDaley11, OpenChess Forum, April 23, 2016
  3. Spartan/bitscan.h at master · christiandaley/Spartan · GitHub
  4. Spartan/bitscan.c at master · christiandaley/Spartan · GitHub
  5. partan/eval.h at master · christiandaley/Spartan · GitHub, #define DIST(sq1, sq2) ((int)sqrt(((…
  6. C sqrt() - C Standard Library
  7. Spartan/Readme.md at master · christiandaley/Spartan · GitHub
  8. Spartan Chess - Chess Variant Page

Up one Level