Skip to content

grokking-vietnam/grokchess

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

43 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Grokchess

This small project is a proof of concept of Neo4j. We clone and extend functionality of freopen.org by adding ability to find shortest path between 2 any players.

Detail of project:

  • Pulling match data from Lichess's database. Right now we pull 1 month data which is approximate 60M games.
  • Streaming match data to Neo4J
  • UI to display the path between 2 players

Demo:

Link to project
Enter user ID of 2 Lichess players (separate by comma). Or you can leave input empty and press enter.

sample

Tech stack:

  • Frontend: React Typescript
  • Backend (API): Flask
  • Crawler: Scala
  • Realtime ingestor: Python
  • Infrastructure: Docker, Kafka, Neo4j