{"id":17874379,"url":"https://github.com/ali2210/super-duper-broccoli","last_synced_at":"2026-01-12T07:26:43.609Z","repository":{"id":114467335,"uuid":"409162832","full_name":"ali2210/super-duper-broccoli","owner":"ali2210","description":"Strategies for implement AI","archived":false,"fork":false,"pushed_at":"2021-09-22T11:32:01.000Z","size":2,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-04-03T00:13:26.567Z","etag":null,"topics":["ai","description","gametheory"],"latest_commit_sha":null,"homepage":"","language":null,"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/ali2210.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}},"created_at":"2021-09-22T10:39:01.000Z","updated_at":"2021-10-02T16:47:58.000Z","dependencies_parsed_at":"2023-06-08T06:30:14.880Z","dependency_job_id":null,"html_url":"https://github.com/ali2210/super-duper-broccoli","commit_stats":{"total_commits":2,"total_committers":1,"mean_commits":2.0,"dds":0.0,"last_synced_commit":"42a5452afe96ddda8093cb36f26ad8255184e5dc"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ali2210/super-duper-broccoli","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ali2210%2Fsuper-duper-broccoli","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ali2210%2Fsuper-duper-broccoli/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ali2210%2Fsuper-duper-broccoli/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ali2210%2Fsuper-duper-broccoli/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ali2210","download_url":"https://codeload.github.com/ali2210/super-duper-broccoli/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ali2210%2Fsuper-duper-broccoli/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28336510,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-12T06:09:07.588Z","status":"ssl_error","status_checked_at":"2026-01-12T06:05:18.301Z","response_time":98,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5: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":["ai","description","gametheory"],"created_at":"2024-10-28T11:08:46.107Z","updated_at":"2026-01-12T07:26:43.594Z","avatar_url":"https://github.com/ali2210.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# super-duper-broccoli\nStrategies for implement AI\n\n\n\n    ## Mathematical Model that solve games \n      1. Game Theory \n      2. Neural Nets \n                   1. Binary Labeling  (Easy but not reality engage) \n                   2. Multiclass labeling (Easy but not reality engage)\n      3. Probalitics / Decision (ok purely mathematical)\n      4. Logics (symbolic annotation)\n      5. Re-enforcement Learning (Reality and limited unless agent have episodic memory) \n      \n     ## Game Theory \n          https://www.youtube.com/watch?v=DXH2EGjRpY4\n          In Game theory imagine you have two player Falcon and snake. Eagle want to kill snake and vice versa. While Imagine a suitation where both players \n          bound with rules of play. According to rule of play Eagle grab the snake and take upto \u003e 15000 ft. Which may cause remain unconsciousness and lost \n          life battle.While Split venom at 1-2 meter. Otherwise serious injury or may be cause of dead. Who win nobody knows.\n        \n          -----------------------------------------------------------------------------------------------\n                           Eagle (win)                                    Snake(win)\n         \n          Snake(lose)     Hawk Altidude \u003e= 15000ft                        Snake split venom \u003e= 0 - 2 meter  Eagle(lose)\n                         \n\n          Snake(win)                            Snake split venom \u003e 2 meter                                  Eagle(win)\n                                                and Eagle altuide \u003c= 10000 ft\n          ---------------------------------------------------------------------------------------------------\n          \n          As you know If Eagle want to win then either death of snake or choose Snake and Eagle win and same with snake.\n          The Real Challenge how long this match you can watch. Problem calculate equation either through probabilistic \n          methods / algorithms or through neural nets weight, Fuzzy Logic. Interesting is this unless player die or quit \n          this match remain continue. Equation Return the best probablity of an event which is unknow \u0026 intact players \n          with this probability as experience.  \n          \n           \n          \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fali2210%2Fsuper-duper-broccoli","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fali2210%2Fsuper-duper-broccoli","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fali2210%2Fsuper-duper-broccoli/lists"}