SGLearn@Artificial Intelligence I: Basics and Games in Java

所在平台: Udemy

课程主页: https://www.udemy.com/course/sglearnartificial-intelligence-i-basics-and-games-in-java/

课程评论:没有评论

第一个写评论        关注课程

课程简介

**课程名称:** SGLearn@人工智能I:Java基础与游戏 **课程概述:** 本课程是SGLearn系列的一部分,专为新加坡学习者设计,旨在帮助他们获得新技能和能力。这门课程是Holczer Balazs开设课程的改编版本,并与Holczer合作专门为新加坡学习者制作。新加坡学习者有资格申请CITREP+资金计划(需符合相关条款和条件)。 课程内容涵盖**人工智能的基础概念**。随着人工智能在软件工程、投资银行等多个领域的广泛应用,该技术日益受到关注。学习算法能够识别模式,例如辅助癌症检测,或预测股票市场走势。 * **第一章:基础图算法** * 介绍图算法,这是一种解决各种高级算法的基础。 * **第二章:局部搜索** * 探讨如何寻找函数中的最小值、最大值或全局最优解。 * 涵盖基本概念以及更高级的算法,如启发式算法和元启发式算法。 * 这些搜索技术常用于回归等场景,以寻找拟合参数。 * **第三章:Minimax算法与游戏AI** * 介绍Minimax算法及其在国际象棋、tic-tac-toe等游戏中的应用。 * 学习如何构建游戏树、分析树状结构。 * 最终将共同实现一个tic-tac-toe游戏。 **课程更新日期:** 2016年10月 **教学大纲:** 无

课程评论(0条)

课程详情

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

课程标签

0人关注该课程

主题相关的课程