【24h】

Teaching Aspects of Constraint Satisfaction Algorithms Via a Game

机译:通过游戏教学约束满足算法的各个方面

获取原文

摘要

In an Artificial Intelligence course, a basic concept is Constraint Satisfaction (CS), which is acknowledged as a hard domain for teachers to teach and student to understand. In this paper, we present a game based learning approach to assist students in learning CS algorithms, such as arc consistency and search algorithms, for problem solving in an easy, interactive and motivating way. Preliminary valuation has showed promising results.
机译:在人工智能课程中,一个基本概念是约束满意度(CS),它被公认为是教师教学和学生理解的硬领域。在本文中,我们提出了一种基于游戏的学习方法,以帮助学生学习CS算法(例如弧一致性和搜索算法),从而以一种轻松,互动和激励的方式解决问题。初步估值显示出可喜的结果。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号