经典谜题中的递推关系及其求解研究  

Study on recurrence relations in classical puzzles and their solutions

作　　者：李远哲 高世乐[2] Li Yuanzhe;Gao Shile(School of Computer Science,Southwest Petroleum University,Chengdu 610500,China;School of Business Administration,Huaqiao University,Quanzhou 362021,China)

机构地区：[1]西南石油大学计算机科学学院,四川成都610500 [2]华侨大学工商管理学院,福建泉州362021

出　　处：《无线互联科技》2019年第21期52-53,132,共3页Wireless Internet Technology

摘　　要：递推是研究算法和编程的重要内容,传统谜题有着受众广、社会影响力大的特征,主要探讨递推关系的谜题更具特色。文章以受限的汉诺塔、Reve谜题和安全开关谜题为例,来探讨递推关系及其显式公式,以期对计算机专业师生学习递推关系的研究有所启发。Recurrence relation is an important part of research on algorithm and programming. Traditional puzzles have the characteristics of wide audiences and great social inf luence. Those puzzles which mainly discuss recurrence relations have more characteristics. This paper takes the restricted Hanoi Tower, Reve puzzle and safety switch puzzle as an examples to discuss the recurrence relation and its closed form-formula, in order to inspire the computer professional teachers and students to learn the recurrence relations.

关 键 词：递推关系 受限的汉诺塔 Reve谜题 安全开关谜题 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]