CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
基于栈结构的孔明棋算法研究
Authors
张桂芬
葛丽娜
黄银娟
Publication date
10 December 2009
Publisher
计算机技术与发展
Abstract
孔明棋是一种玩法简单,但其中变化无数的益智游戏。对孔明棋求解问题进行分析,提出了基于回溯思想的递归和非递归算法,运行结果表明了算法的有效性。文章还围绕栈在存储数据、消解递归等方面的应用对两个算法的优缺点进行了比较分析,递归算法结构清晰,但递归调用次数多;而非递归算法借助程序栈,将程序向循环转化,降低了时间复杂度,但算法难以分析和理解。因此在求解实际问题时可以采用递归思想来分析,然后借助栈用非递归来实现算法。广西自然科学基金资助项目(0832084
Similar works
Full text
Available Versions
Institutional Repository of Guangxi University for Nationalities (GUN) / 广西民族大学机构知识库
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ir.gxun.edu.cn:530500/793
Last time updated on 17/10/2019