SMART: SMART Minimax Analyser for Recursive Trees. The goal of the SMART project is to develop a powerful state-of-the art FICS compliant chess engine, using experimental technology (re-iterative MTDf , ETC, reinforced temporal difference learning, etc.)

Project Activity

See All Activity >

License

BSD License, GNU General Public License version 2.0 (GPLv2)

Follow S.M.A.R.T. Chess Engine

S.M.A.R.T. Chess Engine Web Site

You Might Also Like
Our Free Plans just got better! | Auth0 by Okta Icon
Our Free Plans just got better! | Auth0 by Okta

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Try free now
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of S.M.A.R.T. Chess Engine!

Additional Project Details

Operating Systems

Linux, BSD

Languages

English

Intended Audience

End Users/Desktop

Programming Language

C

Related Categories

C Board Games, C Turn Based Strategy Game, C Chess Games, C Chess Engines

Registered

2002-07-11