{"id":20303147,"url":"https://github.com/vanities/hill_climbing","last_synced_at":"2025-03-04T06:44:50.895Z","repository":{"id":124357295,"uuid":"126406839","full_name":"vanities/Hill_Climbing","owner":"vanities","description":"Hill Climbing techniques used to find maximums (or minimums) of multi-dimensional functions using Greedy and Simulated Annealing search methods.","archived":false,"fork":false,"pushed_at":"2018-03-24T22:33:43.000Z","size":1225,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-14T11:03:56.599Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","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/vanities.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":"2018-03-22T23:30:39.000Z","updated_at":"2018-03-24T22:33:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"94bee835-3d80-471b-bd60-ed420f5639f8","html_url":"https://github.com/vanities/Hill_Climbing","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vanities%2FHill_Climbing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vanities%2FHill_Climbing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vanities%2FHill_Climbing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vanities%2FHill_Climbing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/vanities","download_url":"https://codeload.github.com/vanities/Hill_Climbing/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241801194,"owners_count":20022383,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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-14T16:36:06.773Z","updated_at":"2025-03-04T06:44:50.879Z","avatar_url":"https://github.com/vanities.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hill_Climbing\nHill Climbing techniques used to find maximums (or minimums) of multi-dimensional functions using Greedy and Simulated Annealing search methods.\n\nThe traditional Sum of Gaussians is used to make a random function to test on. Our first goal was for a greedy method, \"greedy.cpp\". The second being a harder, but better solution of using Simulated Annealing, \"sa.cpp\". There's a bunch of scripts in that folder, mostly testing hundreds if not thousands of multi-dimensional Sum of Gaussian functions. Simulated annealing is interesting and not trivial at all.\n\nSee report for more details.\n\n### Instructions:\n1. compile the project with:\n ```make```\n \n2. run the code for greedy hill climbing, where:\u003cbr\u003e\n```./greedy seed number_of_dimensions number_of_gaussian_function_centers```\u003cbr\u003e\nor for simulated annealing:\u003cbr\u003e\n```./sa seed number_of_dimensions number_of_gaussian_function_centers```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvanities%2Fhill_climbing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvanities%2Fhill_climbing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvanities%2Fhill_climbing/lists"}