SGLearn@Artificial Intelligence I: Basics and Games in Java

Welcome to the SGLearn Series targeted at Singapore-based learners picking up new skillsets and competencies.

This course is an adaptation of the same course by Holczer Balazs and is specially produced in collaboration with Holczer for Singaporean learners. If you are a Singaporean, you are eligible for the CITREP+ funding scheme, terms and conditions apply.

---------------

This course is about the fundamental concepts of artificial intelligence. This topic is getting very hot nowadays because these learning algorithms can be used in several fields from software engineering to investment banking. Learning algorithms can recognize patterns which can help detect cancer for example. We may construct algorithms that can have a very  very good guess about stocks movement in the market.

In the first chapter we are going to talk about the basic graph algorithms. Several advanced algorithms can be solved with the help of graphs, so as far as I am concerned these algorithms are the first steps.

Second chapter is about local search: finding minimum and maximum or global optimum in the main. These searches are used frequently when we use regression for example and want to find the parameters for the fit. We will consider basic concepts as well as the more advanced algorithms: heuristics and meta-heuristics.

The last topic will be about minimax algorithm and how to use these technique in games such as chess or tic-tac-toe, how to build and construct a game tree, how to analyze these kinds of tree like structures and so on. We will implement the tic-tac-toe game together in the end.

LAST UPDATE OF THE COURSE: 2016 october