Skip to content
/ hqperft Public

Chess move generation based on (H)yperbola (Q)uintessence & range attacks

License

Notifications You must be signed in to change notification settings

abulmo/hqperft

Folders and files

NameName
Last commit message
Last commit date

Latest commit

author
Richard Delorme
Mar 24, 2024
b624b6c · Mar 24, 2024

History

19 Commits
Dec 24, 2018
Feb 17, 2017
Mar 24, 2024
Feb 17, 2017
Mar 24, 2024

Repository files navigation

hqperft

Fast chess move generation based on (H)yperbola (Q)uintessence & rank attacks.

Usage:

hqperft [--fen|-f <fen>] [--depth|-d <depth>] [--hash|-H <size>] [--bulk|-b] [--div] [--capture] [--help|-h] 
Enumerate moves.
	--help|-h            Print this message.
	--fen|-f <fen>       Test the position indicated in FEN format (default=starting position).
	--depth|-d <depth>   Test up to this depth (default=6).
	--bulk|-b            Do fast bulk counting at the last ply.
	--hash|-H <size>     Use a hashtable with <size> bits entries (default 0, no hashtable).
	--capture|-c         Generate only captures.
	--loop|-l            Loop from depth 1 to <depth>
	--div|-r             Print a node count for each move.

About

Chess move generation based on (H)yperbola (Q)uintessence & range attacks

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published