期刊文献+

国际象棋中马的周游路线问题的递归算法 被引量:2

Recursive algorithm for travel route problem of horse in chess
在线阅读 下载PDF
导出
摘要 递归算法是解决许多实际问题的重要而有效的方法。首先对一类国际象棋中马的周游路线问题进行了分析,然后提出一种基于递归策略的解决方案,并给出了算法的具体实现过程。实验结果验证了方法的有效性。 Recursive algorithm is important and efficient methods to many problems. The travel route problem of horse in chess was brought up firstly. And then, an efficient algorithm was proposed based on recursive algorithm. Simulation results show it is effective.
作者 辛玲 王相海
出处 《计算机工程与设计》 CSCD 北大核心 2006年第1期47-48,79,共3页 Computer Engineering and Design
基金 国家自然科学基金项目(60372071) 辽宁省自然科学基金项目(20032125) 辽宁省高等学校优秀人才基金项目(RC-04-11)
关键词 递归算法 国际象棋 周游路线 复杂度 recursive algorithm chess horse travel route complexity
  • 相关文献

参考文献5

二级参考文献20

  • 1Idesawa M. A system to generate a solid figure from a three view[J]. Bull. Jap.Soc. Mech.Eng, 1973,16:216-225.
  • 2Aldefeld B, Richter H. Semiautomatic three-dimensional interpretation of line draws[J]. Computer & Graphics,1984,8(4):371-380.
  • 3Shum S S P, Lau W S, Yuen M M F, et al. Solid reconstruction from orthographic views using 2-stage extrusion[J]. COMPUTER-AIDED DESIGN, 2001,33(1):91-102.
  • 4Shi-Xia Liu,Shi-Min Hu,Yu-Jian Chen, et al. Reconstruction of curved solids from engineering drawings[J]. COMPUTER-AIDED DESIGN,2001,33(14):1059-1072.
  • 5Tam K S, Atkinson J. An approach for creating solid models from orthogonal views by identification of Boolean operations[J]. Journal of Materials Processing Technology, 2003,138(1):163-169.
  • 6Weidong Geng, Jingbin Wang, Yiyang Zhang. Embedding visual cognition in 3D reconstruction from multi-view engineering drawings[J]. COMPUTER-AIDED DESIGN, 2002,34(4):321-336.
  • 7Chen Z, Peng D. Automatic reconstruction of 3D solid objects from 2D orthographic views[J]. Pattern Recognition, 1988,21(5):439-449.
  • 8Lee C Y An Algorithm for Path Connections and Its Applications[J].IEEE Trans on Electron.Comput,1961,EC-10:346—365.
  • 9王若梅 贺晓军.数据结构[M].西安:西安电子科技大学出版社,1999.130-133.
  • 10孙德梅,贾鸿雁.网络各点间最短距离的矩阵算法[J].哈尔滨师范大学自然科学学报,1998,14(2):24-26. 被引量:4

共引文献8

同被引文献17

  • 1杨庆红,罗坚.递归问题的非递归实现方法研究与应用[J].计算机时代,2005(8):44-45. 被引量:6
  • 2王华,马亮,顾明.线程池技术研究与应用[J].计算机应用研究,2005,22(11):141-142. 被引量:46
  • 3Ford W,Topp W. Data Structures with C + + [M]. [s. l. ] : Prentice Hall, 1996.
  • 4李立中,林顺喜.孔明棋的电脑解法研究[EB/OL].2002-08-23.http://alg.ice.ntnu.edu.rw/Acewise/does/KonMing.doc.
  • 5Kruse R, Tondo C L, Leurlg B. Data Structures & Program Design in C[ M]. [s. l. ]:Prentice- Hall, 1997.
  • 6Sahni S. Data Structures Algorithms and Applications in C + + [M]. Columbus: Mc Graw - hill, 1999.
  • 7马军红.递归与非递归算法比较及效率分析.科技信息,2008,(31):554-556.
  • 8Van Baar R B,Alink W,Van Ballegooij A R.Forensics memory analysis:File mapped in memory[J].Digital Investigation,2008(5):52-57.
  • 9Luoma V M.Computer forensics and electronic discovery:The new management challenge[J].Computer & Security,2006(25):91-96.
  • 10Morgan T D.Recovering deleted data from the windows registry[J].Digital Investigation,2008(5):33-41.

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部