This repo contains our implementation of the method proposed in the research paper "Solving NP-Hard Problems on Graphs With Extended AlphaGo Zero" by Kenshin Abe, Zijian Xu, Issei Sato, Masashi Sugiyama. We attempt to apply this method to the longest path problem, an NP-Hard graph problem not presented in the paper. We also include a live testing environment using the Kraken API and user interface for viewing this environment.
forked from mecsabb/arbitrage
-
Notifications
You must be signed in to change notification settings - Fork 0
qmind project 2023/2024
IsaiahIruoha/arbitrage
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
qmind project 2023/2024
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- JavaScript 44.2%
- Python 43.2%
- CSS 12.0%
- Other 0.6%