An Educational Software Tool to Teach Hyper-Heuristics to Engineering Students Based on the Bubble Breaker Puzzle

被引:4
作者
Salcedo-Sanz, S. [1 ]
Jimenez-Fernandez, S. [1 ]
Matias-Roman, J. M. [1 ]
Portilla-Figueras, J. A. [1 ]
机构
[1] Univ Alcala, Escuela Politecn Super, Dept Signal Proc, Commun, Madrid 28871, Spain
关键词
computer science education; engineering education; software tools; hyper-heuristics; evolutionary algorithms; introduction; SCIENTIFIC COLLABORATION; DISTANCE GRADUATE; COMPUTER GAME; SEARCH; ENVIRONMENT; EXAMPLES;
D O I
10.1002/cae.21597
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents an educational software tool to teach Artificial Intelligence (AI) techniques, specifically Hyper-heuristics, to Engineering students. This tool is based on the Bubble Breaker puzzle, an addictive game consisting in an MxM matrix of colored bubbles. These balls, when forming sets of two or more same colored balls, can be popped and cleared out. Thus, this puzzle can be solved by setting many different low-level heuristics and applying a global search procedure (i.e., evolutionary algorithm) that conforms a robust hyper-heuristic technique. The hyper-heuristic decides what low-level heuristics are the best, and the sequential way in which they have to be applied to gain the highest score. This approach has proven an interesting method to teach AI techniques, since simple heuristics, evolutionary algorithms, and its combination are studied in an increasing manner. (c) 2014 Wiley Periodicals, Inc. Comput Appl Eng Educ 23:277-285, 2015; View this article online at ; DOI
引用
收藏
页码:277 / 285
页数:9
相关论文
共 38 条
  • [1] Conquer the Net: An Educational Computer Game to Learn the Basic Configuration of Networking Components
    Arevalillo-Herraez, Miguel
    Moran-Gomez, Raul
    Claver, Jose M.
    [J]. COMPUTER APPLICATIONS IN ENGINEERING EDUCATION, 2012, 20 (01) : 72 - 77
  • [2] Baier H., 2012, 2012 IEEE Conference on Computational Intelligence and Games (CIG 2012), P227, DOI 10.1109/CIG.2012.6374160
  • [3] Efficient solutions for Mastermind using genetic algorithms
    Berghman, Lotte
    Goossens, Dries
    Leus, Roel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 1880 - 1885
  • [4] Burke E, 2003, INT SER OPER RES MAN, V57, P457, DOI 10.1007/0-306-48056-5_16
  • [5] Burke E. K., 2013, J OPER RES SOC, V64, P1725
  • [6] Burke E. K., 2010, HDB METAHEURISTICS I
  • [7] A graph-based hyper-heuristic for educational timetabling problems
    Burke, Edmund K.
    McCollum, Barry
    Meisels, Amnon
    Petrovic, Sanja
    Qu, Rong
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) : 177 - 192
  • [8] A tabu-search hyperheuristic for timetabling and rostering
    Burke, EK
    Kendall, G
    Soubeiga, E
    [J]. JOURNAL OF HEURISTICS, 2003, 9 (06) : 451 - 470
  • [9] Some practical techniques for global search in Go
    Chen, KH
    [J]. ICGA JOURNAL, 2000, 23 (02) : 67 - 74
  • [10] Cowling P, 2002, LECT NOTES COMPUT SC, V2279, P1