Home Projects lc0
lc0
C++

lc0

Open source neural network chess engine with GPU acceleration and broad hardware support.

by LeelaChessZero · GitHub
Stars
Forks
License
Created
Last commit
Category
Language
alphazeroalphazero-inspiredchessGPL-3.0C++
View on GitHub
In plain words

Play chess against a neural network engine that learns from games.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
lc0 — GitHub preview card
📈 Star history
3.2k3.1k
2026-07-072026-08-31
📈 Track lc0

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Open source neural network chess engine with GPU acceleration and broad hardware support.

lc0 has 3.2k stars on GitHub. It has been forked 599 times. lc0 is written mainly in C++. It has been in active development since 2018. lc0 is available under the GPL-3.0 license. Its main topics are alphazero, alphazero-inspired, chess, chess-ai.

Frequently asked questions

What is lc0?

Open source neural network chess engine with GPU acceleration and broad hardware support.

Is lc0 open source?

lc0 is an open-source project. It is released under the GPL-3.0 license.

Is lc0 free?

Yes. lc0 is free and open source — you can use, modify and self-host it. Its GPL-3.0 license is copyleft: if you distribute a modified version, it must remain under the same license.

What license does lc0 use?

lc0 is available under the GPL-3.0 license.

What language is lc0 written in?

lc0 is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — lc0

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=leelachesszero-lc0)](https://olud.ai/project/leelachesszero-lc0.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.