期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Characterization of Achievable Patterns of the MN-Puzzle Problem
1
作者 杨红青 《Journal of Computer Science & Technology》 SCIE EI CSCD 1990年第3期266-274,共9页
One important MN-puzzle problem is to find a sequence of up-down and right-left movements of the empty-cell so that a goal-pattern can be achieved from a given initial-pattern.The second problem is to characterize the... One important MN-puzzle problem is to find a sequence of up-down and right-left movements of the empty-cell so that a goal-pattern can be achieved from a given initial-pattern.The second problem is to characterize the totality of the goal-pattern from a given initial-pattern.The third problem is finding the fewest movements to achieve it.In this paper,these problems will be completely solved. 展开更多
关键词 A Characterization of Achievable Patterns of the mn-puzzle Problem
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部