![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Algorithm
文章平均质量分 63
magicblue
这个作者很懒,什么都没留下…
展开
-
Computing with huge integer
This article is came from a discussion in forum, it is a problem to computing f(n) that f(n) = fibonacci[i-1]*fibonacci[i]*fibonacci[i+1]. Apparently the vaule of f(n) is too huge to represented by p原创 2005-07-06 18:17:00 · 1009 阅读 · 2 评论 -
The BackTracking algorithm for n queen problem
The article is about the design of algorithm for n queen problem. The intention of this article is from an excise of an algorithm book: >. This backtracking algorithm is interesting, so I decide to re原创 2005-04-06 00:55:00 · 2488 阅读 · 0 评论 -
Optimization of BackTracking algorithm for n queen problem
I think it is necessary to analyze the efficiency class before optimize it. It is difficult to estimate the efficiency class accurately because the each of recurrence running time is different. So I u原创 2005-04-07 19:27:00 · 1828 阅读 · 0 评论 -
Utilizing symmetry characteristic of n queen problem
Given a solution and image the chess board is transparent. Another solution can be got immediately by turn this chess board (left-right turn). That is, look the solution from other side of chess board原创 2005-04-12 12:23:00 · 1027 阅读 · 0 评论 -
Space and time trade-off in n queen problem
The backtracking algorithm of n queen problem can be improved by space and time trade-off further. The consideration of positions occupancy is attained by duplicate_array and two integrals. Note that原创 2005-04-10 23:08:00 · 991 阅读 · 0 评论 -
An attempt of “1 generates others 7” characteristic
I have tried to utilizing the “1 generates others 7” characteristic of n queen problem. Finally, I found that it must have the knowledge of relationship between n and numbers of solutions. The program原创 2005-04-18 12:15:00 · 866 阅读 · 0 评论 -
据说是一道百度的笔试题
在论坛上看到有人问这个,觉得其中一个有点意思就回了。顺便把回的内容发在这里。题目是这样的:///////////////////////////////////////////////////////////////////// answer beginning //////////////////////////////////////////////////////////////原创 2008-01-25 16:28:00 · 1163 阅读 · 2 评论 -
扩展A*算法
A*算法作为一种启发式寻路算法比一般的shortest path finding比如dijkstra算法更快,但是由于启发式的原因,其结果不一定是最优的。 只有在一定的条件下,A*算法才能保证找到最优解。这个条件是A*算法的启发式h(n)必须是consistency或者monotonicity的:A heuristic h(n) is consistent if, for every原创 2008-01-05 10:43:00 · 1443 阅读 · 0 评论