Heuristic Search: Foundations of AI
This course will cover Best-first search, Algorithm A, A* algorithms, Beam search and Adversarial search.
Duration
4 weeksWeekly study
0 hours
Heuristic Search: Foundations of AI
Learn about Best-first search, Algorithm A, A* algorithms and types of searches.
This course will cover Best-first search, Algorithm A, A* algorithms, Beam search and Adversarial search. Learn about how a search can be non-random. How it must be guided by some heuristic. How that heuristic may fail and how Heuristic design is an empirical problem.
What topics will you cover?
- Topic 1: Heuristic Search. We learn about how a search could be non-random. It must be guided by some heuristic. A heuristic may fail. Heuristic design is an empirical problem.
- Topic 2: Algorithm A and A* . We discover that a best-first heuristic search can have some interesting properties if we restrict the kind of heuristic it uses. We discover the A* algorithm, which tries to point us towards better heuristics.
- Topic 3: Heuristic Search (more). We discover that finding some form of A* algorithm is easy. The trick is finding a good form of A* algorithm. In this week, we introduce the first big coding practical for marks, to implement an A* algorithm in a complex 3D JavaScript “World” on the Ancient Brain coding site.
- Topic 4: Adversarial Search. We consider a different form of search, one where there is an “opponent” taking us further away from the goal as we are trying to move towards the goal. We consider modelling how the opponent will act.
Learning on this course
On every step of the course you can meet other learners, share your ideas and join in with active discussions in the comments.
What will you achieve?
By the end of the course, you‘ll be able to...
- Demonstrate an understanding of different forms of heuristic and non-random search..
- Explain how to design a heuristic and how its properties will impact our search, both in terms of time taken and solution delivered.
- Demonstrate how to code a heuristic search in a compelling 3D visual world. This section should be lots of fun.
Who is the course for?
The course is aimed at IT professionals in employment in Republic of Ireland registered companies. To qualify for direct entry they must have a Level 8 Honours Degree (2.2) or higher in Computer Science, Computing, Computer Applications or a related discipline. Applicants without these entry requirements (e.g., Level 7 degree or lower than an Honours 2.2 in a Level 8 degree) may be considered if they can demonstrate previously obtained competence equivalent to the entry requirements.
Who will you learn with?
Dr. Mark Humphrys is a lecturer at DCU. He has a BSc from UCD and a PhD from Cambridge. His research interests are in AI. He is the inventor of the coding site "Ancient Brain".
Who developed the course?
Dublin City University
Dublin City University is a young, dynamic and ambitious Irish university with a distinctive mission to transform lives and societies through education, research and innovation.
Endorsers and supporters
funded by
Learning on FutureLearn
Your learning, your rules
- Courses are split into weeks, activities, and steps to help you keep track of your learning
- Learn through a mix of bite-sized videos, long- and short-form articles, audio, and practical activities
- Stay motivated by using the Progress page to keep track of your step completion and assessment scores
Join a global classroom
- Experience the power of social learning, and get inspired by an international network of learners
- Share ideas with your peers and course educators on every step of the course
- Join the conversation by reading, @ing, liking, bookmarking, and replying to comments from others
Map your progress
- As you work through the course, use notifications and the Progress page to guide your learning
- Whenever you’re ready, mark each step as complete, you’re in control
Want to know more about learning on FutureLearn? Using FutureLearn