{"id":23170816,"url":"https://github.com/waynejz/comp9414-18s1","last_synced_at":"2026-02-25T08:05:13.161Z","repository":{"id":100535023,"uuid":"140745782","full_name":"WayneJz/COMP9414-18S1","owner":"WayneJz","description":"COMP9414 Artificial Intelligence 2018S1","archived":false,"fork":false,"pushed_at":"2018-07-14T15:18:54.000Z","size":8829,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-04-04T23:41:45.480Z","etag":null,"topics":["agent","heuristic-algorithm","pathfinding","prolog"],"latest_commit_sha":null,"homepage":null,"language":"Prolog","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/WayneJz.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-07-12T17:39:05.000Z","updated_at":"2019-08-22T22:55:36.000Z","dependencies_parsed_at":"2023-05-19T10:46:46.376Z","dependency_job_id":null,"html_url":"https://github.com/WayneJz/COMP9414-18S1","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/WayneJz/COMP9414-18S1","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WayneJz%2FCOMP9414-18S1","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WayneJz%2FCOMP9414-18S1/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WayneJz%2FCOMP9414-18S1/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WayneJz%2FCOMP9414-18S1/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/WayneJz","download_url":"https://codeload.github.com/WayneJz/COMP9414-18S1/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WayneJz%2FCOMP9414-18S1/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29815020,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-25T05:36:42.804Z","status":"ssl_error","status_checked_at":"2026-02-25T05:36:31.934Z","response_time":61,"last_error":"SSL_read: 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":["agent","heuristic-algorithm","pathfinding","prolog"],"created_at":"2024-12-18T04:15:09.204Z","updated_at":"2026-02-25T08:05:13.156Z","avatar_url":"https://github.com/WayneJz.png","language":"Prolog","funding_links":[],"categories":[],"sub_categories":[],"readme":"## COMP9414 Artificial Intelligence 2018S1\n\n### ALL CODES SHOULD BE APPROPRIATELY REFERENCED, COPYING MAY RESULT IN PLAGIARISM\n\nLecturer: Alan Blair\n\n### Main Contents\n\n1. **Environment and Agent** : PEAS Description, Agent Types, Enviornment Classification.\n2. **Prolog Programming** : Queries, Recursion, Loop, Manipulation of Lists (Head and Tail), Sorting, Structures...\n3. **Path Searching** : Uninformed Search (BFS, DFS, IDS...), Heuristic Search (UCS, A-Star, Greedy), Time and Space Complexity.\n4. **Path Searching Application** : Graph Search, Maze Search, 8-puzzle Problem, Heuristic Path Algorithm. \n5. **Game Playing** : Tic-Tac-Toe, Alpha-Beta Search and Alpha-Beta Pruning.\n6. **Decision Tree and Learning** : Decision Trees, Information Entropy and Minimal Entropy Principle, Laplace Pruning.\n7. **Perceptron** : Classifiers, Iterative Training.\n8. **Neural Networks** : Single Neuron, Multi-layer Neural Networks Design, Gradient Descent, Forward Pass and Backpropagation.\n9. **Constraint Satisfication** : Map-Coloring, 8-queens Problem, Backtracking, Forward Checking, Arc-Consistency, Local Search (Hill Climbing, Simulated Annealing).\n10. **Logic** : Validity and Satisfiability, Propositional Logic Solution, First-Order Logic Sentences.\n11. **Uncertainty** : Conditional Probability, Enumerating Probabilities.\n\n### Assessment Details\n\n1. **Assignment 1** : Logical Queries, Manipulation of Lists and Trees. Mark:12/12.\n2. **Assignment 2** : Prolog Tests of Path Search Methods (Efficiency and optimum), Heuristic Algorithm, Maze Search, Distance Calculation . Mark:10/10.\n3. **Assignment 3** : Prolog Project with using complex list manipulation and logic. Mark:17.2/18.\n\n### Disclaimer\n\n1. No responsibility will be taken if some mistakes influence your mark. It is better to check before referencing.\n2. No responsibility will be taken if copying codes results in detected plagiarism.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwaynejz%2Fcomp9414-18s1","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwaynejz%2Fcomp9414-18s1","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwaynejz%2Fcomp9414-18s1/lists"}