{"id":23136935,"url":"https://github.com/mark-nawar/the_castle_fight","last_synced_at":"2025-07-22T13:34:12.110Z","repository":{"id":119074235,"uuid":"327070505","full_name":"Mark-Nawar/The_castle_fight","owner":"Mark-Nawar","description":"A Data Structures simulation using the classical castle fight game","archived":false,"fork":false,"pushed_at":"2021-01-18T13:04:32.000Z","size":230,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-11T15:53:50.667Z","etag":null,"topics":["castle-game","enemies","game","periority-queue","queue-simulation","simulatiom","stack"],"latest_commit_sha":null,"homepage":"","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/Mark-Nawar.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":"2021-01-05T17:27:07.000Z","updated_at":"2021-01-18T13:07:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"355c4919-066d-4a93-a7a3-1f75e667df27","html_url":"https://github.com/Mark-Nawar/The_castle_fight","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Mark-Nawar/The_castle_fight","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mark-Nawar%2FThe_castle_fight","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mark-Nawar%2FThe_castle_fight/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mark-Nawar%2FThe_castle_fight/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mark-Nawar%2FThe_castle_fight/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Mark-Nawar","download_url":"https://codeload.github.com/Mark-Nawar/The_castle_fight/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mark-Nawar%2FThe_castle_fight/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266506179,"owners_count":23940019,"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","status":"online","status_checked_at":"2025-07-22T02:00:09.085Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"robots_txt_url":"https://github.com/robots.txt","online":true,"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":["castle-game","enemies","game","periority-queue","queue-simulation","simulatiom","stack"],"created_at":"2024-12-17T12:26:13.975Z","updated_at":"2025-07-22T13:34:12.081Z","avatar_url":"https://github.com/Mark-Nawar.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# The_castle_fight\nA Datastructure simulation of the classical castle fight game where enemies are represented as Queues , Periority Queues and stacks. There is three types of enemies( Fighters,\nfreezers and healers)\n\nFighters :are the only ones that can decrement the health of the Castle and is them only that can make the castle lose the fight. If they all die that means that the Castle will eventually win the battle.\n\nFrezzers :make the Castle freeze for one time step, there is a threshold that the freeers' attacks towards the castle will contribute towards. \nFor example the the threshold is 10 , Freezer No1 attack will causse a freeze value of 2 , then we need 5 attacks from this freezer to freeze the castle.\n\nHealer : They cannot attack the castle in any way but they have the ability to to heal the enemies that the castle attacked but with a constraint, the enemy must be within\na distance of MAX 2 m from the healer. \n\nEnemenis movement: All enemies start the game 60 M from the castle and get near the castle according to their speed, Fighters and freezers move only towards the Castle Healers \ncan move back and forth towards and away from the Castle healing enemies along the way.\n\n\nThe Castle attack:The Castle can attack all enemies either by bullets or by ice with a ratio of attacking 80 : 20 respectivly.\nthe enemy that Got hit by a bullet will have his health decremented until it dies.\nif the enemy is hit with ice it will be frosted in its location for some time steps where it cannot attack or make whatever action it is doing.\n\n\nThe Data Structures used to represent the enemies are:\n\nPeriority Queue for the Fighters\nPeriority Queue for the Frosted enemies\nQueue for the freezers\nStack for the Healers \nQueue for the inactive enemies \nQueue for the killed enemies.\n\n\n\nEvery Enemy has a:\n1)type \n2)Health\n3)distance from the castle\n4)power\n5)reload period\n6) frost count (Zero when not frosted)\n\nThe Castle has:\n1)Max no of enemies to attack in a single time step.\n2)The Castle Power \n3)The Castle Health \n4)The Freeze threshold \n5)the count towards the max freeze threshold\n\ncheck the Project Pdf for all the details\nTHIS IS A CLASS PROJECT \nCAIRO UNIVERSITY , FACULTY OF COMPUTER ENGINEERING ,CLASS OF 2023\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmark-nawar%2Fthe_castle_fight","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmark-nawar%2Fthe_castle_fight","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmark-nawar%2Fthe_castle_fight/lists"}