{"id":20662420,"url":"https://github.com/evanzhoudev/bestalgfinder","last_synced_at":"2026-04-17T23:35:12.451Z","repository":{"id":104237815,"uuid":"577096234","full_name":"EvanZhouDev/BestAlgFinder","owner":"EvanZhouDev","description":"A way to find the best algorithm for a specific case on the Rubik's cube","archived":false,"fork":false,"pushed_at":"2022-12-12T00:40:54.000Z","size":11,"stargazers_count":1,"open_issues_count":2,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-10T05:55:24.724Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/EvanZhouDev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-12-12T00:08:26.000Z","updated_at":"2024-10-18T23:38:51.000Z","dependencies_parsed_at":null,"dependency_job_id":"4a751480-347e-4b2f-bdf9-137f015eb69f","html_url":"https://github.com/EvanZhouDev/BestAlgFinder","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/EvanZhouDev/BestAlgFinder","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EvanZhouDev%2FBestAlgFinder","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EvanZhouDev%2FBestAlgFinder/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EvanZhouDev%2FBestAlgFinder/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EvanZhouDev%2FBestAlgFinder/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/EvanZhouDev","download_url":"https://codeload.github.com/EvanZhouDev/BestAlgFinder/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EvanZhouDev%2FBestAlgFinder/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31950565,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-17T17:29:20.459Z","status":"ssl_error","status_checked_at":"2026-04-17T17:28:47.801Z","response_time":62,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-16T19:14:05.227Z","updated_at":"2026-04-17T23:35:12.435Z","avatar_url":"https://github.com/EvanZhouDev.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Best Algorithm Finder\nA simple way to find the best algorithms for any case available on the AlgDB database.\n\n## Made Possible By:\n### Trangium's Movecount Coefficient Calculator:\nWebsite: https://trangium.github.io/MovecountCoefficient/ \u003cbr/\u003e\nSource: https://github.com/trangium/trangium.github.io/blob/master/algSpeed.js\n\n### AlgDB.net\nWebsite: http://algdb.net\n\n## Background\nOn the Rubik's cube, there are thousands of cases that you can run into in specific steps. Each one of these cases has dozens of recognized algorithms. This program can help you pick out the best algorithm(s) for a specific case.\n\n## Installation instructions:\n\u003cdetails\u003e\n\u003csummary\u003eTL;DR\u003c/summary\u003e\nRun the following:\n\n```bash\ngit clone https://github.com/EvanZhouDev/BestAlgFinder.git\ncd ./BestAlgFinder/\nnpm install\n```\n\u003c/details\u003e\n\n1. Clone the repository ```git clone https://github.com/EvanZhouDev/BestAlgFinder.git```\n2. ```cd``` into the new folder ```cd ./BestAlgFinder/```\n3. Install dependancies: ```npm install```\n4. It is ready to use!\n\n## How to Use:\n1. ```cd``` into wherever you put your clone\n2. Run ```node findBestAlg.js ${CASE} ${AMOUNT}```\n\n### CASE Parameter\nThe first parameter, CASE, is what algorithm we are looking at. It follows the AlgDB format.\nHere are some examples:\n- Y Perm: ```pll/y```\n- Na Perm: ```pll/na```\n- OLL 1: ```oll/oll1```\n- and so on...\n\nIf you want to know the path, then go the case on AlgDB and copy the part after \"http://algdb.net/puzzle/333...\" in the URL.\n\n### AMOUNT Parameter\nThe second parameter, AMOUNT, is the top how many algorithms it will display and further analyze. Look at the next section for further explanation.\n\n## Interpreting the Output\nAfter you run the command, you will see 3 main sections.\n\n### Ranking based on Algorithm Coefficient\nThe script automatically scrapes AlgDB for the requested algorithm and ranks them based on the Algorithm's 'coefficient.' The lower the better, and it should vary directly with the time it takes to do the algorithm. The amount listed will be the AMOUNT parameter.\n### Ranking based on Votes\nThe script also automatically looks at what people have voted to be their favorite algorithm on AlgDB. The second section ranks it based on that. The mroe votes the better. The amount listed will be the AMOUNT parameter.\n### Overall Best\nThe last section looks at the overlap between the first two sections. In theory, the algorithms listed under there should be the 'best' algorithms. If you do not see any overlap, increase the AMOUNT parameter.\n*The calculation for these \"overall best\" algorithms may be subject to change*\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fevanzhoudev%2Fbestalgfinder","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fevanzhoudev%2Fbestalgfinder","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fevanzhoudev%2Fbestalgfinder/lists"}