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.
-
Notifications
You must be signed in to change notification settings - Fork 3
mecsabb/arbitrage
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