翻译：《蛇棋》游戏与算法 - 技术总结 - SegmentFault



翻译：《蛇棋》游戏与算法 - 技术总结 - SegmentFault

大家好，《蛇棋》游戏旨在寻找最短路径，本文讲解如何使用广度优先遍历算法（BFS，不了解该算法的同学，请参考这篇文章）来解决该问题。

笔者喜欢实用的技术，而图论就是其一。诚然，其他数据结构也应用广泛，但由于图论的特性，使其与我们的生活联系最为紧密。接下来，笔者就用经典游戏《蛇棋》举例，说明如何使用BFS来解决实际生活中的问题。

想必大家小时候一定都玩过《蛇棋》，规则就不多说了。而这里要说的，则是如何通过图论和BFS，找到最短的路径（掷骰子的次数，以及每次掷的点数），抵达终点赢取胜利。下图为蛇棋棋盘，本文将以它来举例说明。


Read full article from 翻译：《蛇棋》游戏与算法 - 技术总结 - SegmentFault


No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts