refactor

mebusy · Sep 14, 2020 · 401e7f1 · 401e7f1
1 parent 12c865f
commit 401e7f1
Show file tree

Hide file tree

Showing 360 changed files with 7,295 additions and 7,258 deletions.
diff --git a/codes/createMenu.py b/codes/createMenu.py
@@ -87,7 +87,7 @@ def createMenu4MD( path ):
             escaped_title = escaped_title.replace( "]"  , "\\]")
 
             nIndent = sorted(all_title_level).index( curTitleActualLevel ) 
-            menu +=   ( '%s - [%s](#%s)' % ( '    ' * nIndent  , escaped_title ,  id  ) )  +  '\n'
+            menu +=   ( '%s- [%s](#%s)' % ( '    ' * nIndent  , escaped_title ,  id  ) )  +  '\n'
 
             body += '<h2 id="{}"></h2>\n\n\n'.format(  id )
             #print sharps, title

diff --git a/dev_notes/2dTree.md b/dev_notes/2dTree.md
@@ -1,17 +1,17 @@
 ...menustart
 
- - [2D Tree](#24e1aa2b5be033c7c0dcaacc43b2b645)
-     - [Question](#a97ea56b0e00b2379736ae60869ff66a)
-     - [Grid implementation](#70d1a3fb79b2abed2736ccad8427984f)
-     - [Space-partitioning trees](#8e09009743774efb9c0a7dceb8721b2c)
-         - [Space-partitioning trees: applications](#922b62791cfd0af7fb819dd01bf4efb6)
-     - [2d tree construction](#d11bea9d4fe095af9f1ba36b85f24c9d)
-     - [2d tree implementation](#740b6be09ccd4dc6bd568fd9dd316aa9)
-     - [Range search in a 2d tree](#e2f4979395b274707c6c5a37cd7ed619)
-         - [Range search in a 2d tree analysis](#db369429b7d2c848b75e9d11b977c8d1)
-     - [Nearest neighbor search in a 2d tree](#d8734e1f289bf1794afcd19da08a8a6d)
-         - [Nearest neighbor search in a 2d tree analysis](#b5df2dde1669c08bc9b0f0b1a24fb85b)
-     - [实现时，需要注意的地方](#37fe8d31c8ddcdaf1d3002f5c46d9aa1)
+- [2D Tree](#24e1aa2b5be033c7c0dcaacc43b2b645)
+    - [Question](#a97ea56b0e00b2379736ae60869ff66a)
+    - [Grid implementation](#70d1a3fb79b2abed2736ccad8427984f)
+    - [Space-partitioning trees](#8e09009743774efb9c0a7dceb8721b2c)
+        - [Space-partitioning trees: applications](#922b62791cfd0af7fb819dd01bf4efb6)
+    - [2d tree construction](#d11bea9d4fe095af9f1ba36b85f24c9d)
+    - [2d tree implementation](#740b6be09ccd4dc6bd568fd9dd316aa9)
+    - [Range search in a 2d tree](#e2f4979395b274707c6c5a37cd7ed619)
+        - [Range search in a 2d tree analysis](#db369429b7d2c848b75e9d11b977c8d1)
+    - [Nearest neighbor search in a 2d tree](#d8734e1f289bf1794afcd19da08a8a6d)
+        - [Nearest neighbor search in a 2d tree analysis](#b5df2dde1669c08bc9b0f0b1a24fb85b)
+    - [实现时，需要注意的地方](#37fe8d31c8ddcdaf1d3002f5c46d9aa1)
 
 ...menuend
 

diff --git a/dev_notes/3b1b_euler_formula.md b/dev_notes/3b1b_euler_formula.md
@@ -1,6 +1,6 @@
 ...menustart
 
- - [What is Euler's formula actually saying? | Lockdown math ep. 4](#18a0e75f9580b2706a272049017e24fd)
+- [What is Euler's formula actually saying? | Lockdown math ep. 4](#18a0e75f9580b2706a272049017e24fd)
 
 ...menuend
 

diff --git a/dev_notes/3b1b_fourier_transform.md b/dev_notes/3b1b_fourier_transform.md
@@ -1,9 +1,9 @@
 ...menustart
 
- - [But what is the Fourier Transform? A visual introduction.](#cca32b346dc008638fca79b78f457504)
- - [什么是傅立叶变换](#b46cd00ce66cf213faa8731568d09839)
-     - [傅立叶级数](#f638045f1760eebb183feb59937fd197)
-     - [连续傅立叶变换](#87f152e061070fbeb8bf2d97f37a75e6)
+- [But what is the Fourier Transform? A visual introduction.](#cca32b346dc008638fca79b78f457504)
+- [什么是傅立叶变换](#b46cd00ce66cf213faa8731568d09839)
+    - [傅立叶级数](#f638045f1760eebb183feb59937fd197)
+    - [连续傅立叶变换](#87f152e061070fbeb8bf2d97f37a75e6)
 
 ...menuend
 

diff --git a/dev_notes/3b1b_quadratic_formula.md b/dev_notes/3b1b_quadratic_formula.md
@@ -1,8 +1,8 @@
 ...menustart
 
- - [The simpler quadratic formula | Lockdown math ep.1](#07ce9c8defcca1a8cf2f97556ea53127)
-     - [Mental Math Tricks](#c236129fe028b8f8a5fafd195a9426c5)
-     - [Quadratic Formula](#2e0557fe7fcb444a6bdded79c3f233ed)
+- [The simpler quadratic formula | Lockdown math ep.1](#07ce9c8defcca1a8cf2f97556ea53127)
+    - [Mental Math Tricks](#c236129fe028b8f8a5fafd195a9426c5)
+    - [Quadratic Formula](#2e0557fe7fcb444a6bdded79c3f233ed)
 
 ...menuend
 

diff --git a/dev_notes/3b1b_trigonometry.md b/dev_notes/3b1b_trigonometry.md
@@ -1,14 +1,14 @@
 ...menustart
 
- - [Trigonometry fundamentals | Lockdown math ep. 2](#c3747e4cefb7c22e073615c8f0adcf67)
-     - [cos²(x) and cos(2x)](#f481852fd11d79b842d8e4b334e679d4)
-     - [Trigonometry is about circles](#526cf70cd498e0861be1d3420a6827c3)
-     - [Pythagorean theorem](#d5f7765e3debfe3fa6b7dbf00ffc6f48)
-     - [cos(x/2)](#73ae02540a4c988c767f6a41ed5a99e5)
- - [Complex number fundamentals | Lockdown math ep. 3](#c3c421e1caa75d1788f81ac64d05fa47)
-     - [Complex number and Rotation](#85ba6f123827a8e936ea9597617f42f8)
-     - [Reverse operation](#c08d63b19ebc85a1011a5ef3f5925b47)
-     - [relation between cos²(x) and cos(2x)](#9e719b4aef3ac4ce4b37b41a28ffea30)
+- [Trigonometry fundamentals | Lockdown math ep. 2](#c3747e4cefb7c22e073615c8f0adcf67)
+    - [cos²(x) and cos(2x)](#f481852fd11d79b842d8e4b334e679d4)
+    - [Trigonometry is about circles](#526cf70cd498e0861be1d3420a6827c3)
+    - [Pythagorean theorem](#d5f7765e3debfe3fa6b7dbf00ffc6f48)
+    - [cos(x/2)](#73ae02540a4c988c767f6a41ed5a99e5)
+- [Complex number fundamentals | Lockdown math ep. 3](#c3c421e1caa75d1788f81ac64d05fa47)
+    - [Complex number and Rotation](#85ba6f123827a8e936ea9597617f42f8)
+    - [Reverse operation](#c08d63b19ebc85a1011a5ef3f5925b47)
+    - [relation between cos²(x) and cos(2x)](#9e719b4aef3ac4ce4b37b41a28ffea30)
 
 ...menuend
 

diff --git a/dev_notes/3blue1brown.md b/dev_notes/3blue1brown.md
@@ -1,17 +1,17 @@
 ...menustart
 
- - [Essence of linear algebra](#ab7dcbdd05408bb8c50281f539119f94)
-     - [3 Linear transformations and matrices](#ebf4ed4e5dbdf709f6e2a501e1c5cbce)
-     - [4. Matrix multiplication as composition](#9e3659318b7054360844875560006980)
-     - [5. The determinant](#0a05f70d4501925ef20156f580f0b07d)
-     - [6. Inverse matrices, column space and null space](#59e335b6a8c34e003dd810410fbf4e21)
-     - [footnote. Nonsquare matrices as transformations between dimensions](#8e0c7f26d1f694558baee5ef34fe55ef)
-     - [7. Dot products and duality](#04629028685253ba3138ddced808a1ce)
-     - [8. Cross products](#c21e7bf7d55df7edb7e2f6a780fbccd6)
-         - [Cross products in the light of linear transformations](#d6f39fcd3624e0b509757af47be8f6c5)
-     - [9. Change of basis](#a08ecda2d10894d7eda0f957ef9a7ce4)
-     - [10. Eigenvectors and eigenvalues](#d7095a9bb84406d5fb5ed382385c7d16)
-     - [11. Abstract vector spaces](#d0019094c72f442cca76cf5e53f49e73)
+- [Essence of linear algebra](#ab7dcbdd05408bb8c50281f539119f94)
+    - [3 Linear transformations and matrices](#ebf4ed4e5dbdf709f6e2a501e1c5cbce)
+    - [4. Matrix multiplication as composition](#9e3659318b7054360844875560006980)
+    - [5. The determinant](#0a05f70d4501925ef20156f580f0b07d)
+    - [6. Inverse matrices, column space and null space](#59e335b6a8c34e003dd810410fbf4e21)
+    - [footnote. Nonsquare matrices as transformations between dimensions](#8e0c7f26d1f694558baee5ef34fe55ef)
+    - [7. Dot products and duality](#04629028685253ba3138ddced808a1ce)
+    - [8. Cross products](#c21e7bf7d55df7edb7e2f6a780fbccd6)
+        - [Cross products in the light of linear transformations](#d6f39fcd3624e0b509757af47be8f6c5)
+    - [9. Change of basis](#a08ecda2d10894d7eda0f957ef9a7ce4)
+    - [10. Eigenvectors and eigenvalues](#d7095a9bb84406d5fb5ed382385c7d16)
+    - [11. Abstract vector spaces](#d0019094c72f442cca76cf5e53f49e73)
 
 ...menuend
 

diff --git a/dev_notes/6502.md b/dev_notes/6502.md
@@ -1,33 +1,33 @@
 ...menustart
 
- - [1. 6502](#7bf16fdc3eac99cae812655048ddebfd)
-     - [寄存器](#6d43d1705d48c0ef4ba09ee10f9a6ede)
-     - [中断和复位](#7362c7b186e3d727f9d335bbb67e2dfc)
-         - [中断](#d8d7ca77e957a505e5f4e78ca64a047f)
-         - [复位](#22d9202d0abac39c74830494ac99ab78)
-     - [CPU 管理的内存分布](#d86dc8ade6a178f9dc7b8cc9d9abc962)
-     - [PPU 管理的内存分布](#21f4bc1a99e4d80f0a692fa8bac50375)
-     - [PPU 控制寄存器 $2000 ~ $2007](#af941fe661bcc71b82a8b3d78ccc3fe9)
- - [2. 寻址方式](#4b401594a91d7d07bf9f87dbd55179e5)
-     - [1 立即寻址](#fed85333fbf61d3bd309f2c5d49d7898)
-     - [2 绝对寻址 Absolute Addressing](#c4393512319e51eef7a6f0321df11983)
-     - [3 零页寻址](#42dac4ebd4c68b9bd4852ebe42a0a25f)
-     - [4 隐含寻址  Implied Addressing](#ca74e275195e30ba64f4fc5b602d3ee8)
-     - [5. 累加器寻址 Accumulator Addressing](#613e31448c0eb6f1e323c246c767009b)
-     - [6. 绝对X变址寻址 Absolute X-Index Addressing](#b57e118ee434c1adfc72dbe13d4f1dbb)
-     - [7. 绝对Y变址寻址 Absolute Y-Index Addressing](#f5c6a27b2775b74b2ac1c529b83aacf2)
-     - [8. 零页变址寻址](#d0c9cf4a9cca3d34389d6c81e60d2b76)
-     - [9. 间接寻址 Indirect Addressing](#f508c6be6e13d5dad1932f5108310bb0)
-     - [10. 相对寻址 Relative Addressing](#f14cea5696e057af93d41d2b8c9380e2)
-     - [11. 先变址 间接寻址](#763e53983b8ae35c864d4f7098d649ce)
-     - [12. 后变址间接寻址](#82664afe646212b6b4d39ee9578da5ad)
- - [3. 指令系统](#7d23657cbc2158a57f0789cd68e67368)
-     - [数据传送类](#1778c6a29d7ae6f9f53d9c4c843aaa8b)
-     - [算术运算类](#6aceedd632199850df358c63402ca0d8)
-     - [逻辑运算 与 位测试 指令](#dd8a98748d5b17d12f71fdce90638deb)
-     - [程序控制类指令](#b14021fef8148aaf79f3a6e5bd1e3331)
-     - [其他 ？](#a64774e9e7a44832c4a7c5de98d946cb)
-     - [undocumented instruction](#84ddfd69712705ceb2c4f511f0c1a5f3)
+- [1. 6502](#7bf16fdc3eac99cae812655048ddebfd)
+    - [寄存器](#6d43d1705d48c0ef4ba09ee10f9a6ede)
+    - [中断和复位](#7362c7b186e3d727f9d335bbb67e2dfc)
+        - [中断](#d8d7ca77e957a505e5f4e78ca64a047f)
+        - [复位](#22d9202d0abac39c74830494ac99ab78)
+    - [CPU 管理的内存分布](#d86dc8ade6a178f9dc7b8cc9d9abc962)
+    - [PPU 管理的内存分布](#21f4bc1a99e4d80f0a692fa8bac50375)
+    - [PPU 控制寄存器 $2000 ~ $2007](#af941fe661bcc71b82a8b3d78ccc3fe9)
+- [2. 寻址方式](#4b401594a91d7d07bf9f87dbd55179e5)
+    - [1 立即寻址](#fed85333fbf61d3bd309f2c5d49d7898)
+    - [2 绝对寻址 Absolute Addressing](#c4393512319e51eef7a6f0321df11983)
+    - [3 零页寻址](#42dac4ebd4c68b9bd4852ebe42a0a25f)
+    - [4 隐含寻址  Implied Addressing](#ca74e275195e30ba64f4fc5b602d3ee8)
+    - [5. 累加器寻址 Accumulator Addressing](#613e31448c0eb6f1e323c246c767009b)
+    - [6. 绝对X变址寻址 Absolute X-Index Addressing](#b57e118ee434c1adfc72dbe13d4f1dbb)
+    - [7. 绝对Y变址寻址 Absolute Y-Index Addressing](#f5c6a27b2775b74b2ac1c529b83aacf2)
+    - [8. 零页变址寻址](#d0c9cf4a9cca3d34389d6c81e60d2b76)
+    - [9. 间接寻址 Indirect Addressing](#f508c6be6e13d5dad1932f5108310bb0)
+    - [10. 相对寻址 Relative Addressing](#f14cea5696e057af93d41d2b8c9380e2)
+    - [11. 先变址 间接寻址](#763e53983b8ae35c864d4f7098d649ce)
+    - [12. 后变址间接寻址](#82664afe646212b6b4d39ee9578da5ad)
+- [3. 指令系统](#7d23657cbc2158a57f0789cd68e67368)
+    - [数据传送类](#1778c6a29d7ae6f9f53d9c4c843aaa8b)
+    - [算术运算类](#6aceedd632199850df358c63402ca0d8)
+    - [逻辑运算 与 位测试 指令](#dd8a98748d5b17d12f71fdce90638deb)
+    - [程序控制类指令](#b14021fef8148aaf79f3a6e5bd1e3331)
+    - [其他 ？](#a64774e9e7a44832c4a7c5de98d946cb)
+    - [undocumented instruction](#84ddfd69712705ceb2c4f511f0c1a5f3)
 
 ...menuend
 

diff --git a/dev_notes/AI_CS188.md b/dev_notes/AI_CS188.md
@@ -1,71 +1,71 @@
 ...menustart
 
- - [AI , CS 188](#aea7deb258843dff16f9b84b46ec1461)
- - [Introduction](#0b79795d3efc95b9976c7c5b933afce2)
-     - [What is AI](#9fa835a40078a81e452b0cbb4362a6f5)
-     - [Designing Rational Agents](#04052b6bc5dad6a9f6a00dfb9cd988da)
-     - [Reflex Agents](#9ef57e59fc5834eb1f86775a80163590)
-     - [Planning Agents](#b35ab1adff6f2f91e25f048a1f1ecfcc)
-     - [Course Topics \*](#75947eb557ad99ec6bd6f19e5842e7c0)
- - [Uninformed Search](#faccc055dce5dfee94eba9a23ec379bc)
-     - [Search Problems](#fc72ba154e470ee2e177ed8e75ee4de2)
-     - [Search Problems Are Models](#0a9e0b58d3ed416bdb73713846200baa)
-         - [Example: Traveling in Romania](#30f0fbd7fae0ee74806b20a52d15e3ee)
-     - [What’s in a State Space ?](#e753d55f3a61b93cba852a33216321e0)
-     - [State Space Sizes ?](#05eb0fb2a7cf700d9734545149fc43fb)
-     - [Quiz: Safe Passage](#10f2374e81dfff89cef5eecf517b70ef)
-     - [State Space Graphs and Search Trees](#12227407175834cc50274fb425cf4e2d)
-         - [State Space Graphs](#91fa96e85b0a665a30ab89661d0137c4)
-         - [Search Trees](#fa3d63f947f57a28158a9af70e100ef3)
-         - [State Space Graphs vs. Search Trees](#3371ddd82f34162d684dfd1d1f40d8b3)
-         - [Quiz: State Space Graphs vs. Search Trees](#76acaf4079e010db2a41f612ceae95f4)
-         - [Searching with a Search Tree](#643025d557c3b9f6d43cdd62b77f5530)
-         - [General Tree Search](#a23c40de844ed1e2415dc477845012af)
-         - [Depth-First Search](#d292eaede65eb34e66db0db9ebb6b9bc)
-             - [Search Algorithm Properties](#6dda6174af1ce92b505f3c29643504c3)
-             - [Depth-First Search (DFS) Properties](#62a9189e6707b0db89f80a7a5bb6c15e)
-         - [Breadth-First Search](#ae5c4b868b5b24149decba70c74165c2)
-             - [Breadth-First Search (BFS) Properties](#0d9bfd747ee897d1720abf029faddae4)
-             - [Iterative Deepening](#fcbd892c255445e0e3c99ceeb0dbc2e9)
-         - [Cost-Sensitive Search](#ea10a2ff2bc1cbc4cb292e4f88cad9e9)
-             - [Uniform Cost Search](#1bd1e9029adb17c5893239e7288210a9)
-             - [Uniform Cost Search (UCS) Properties](#8fcce2120d7405462b72fce3bf1fcaaa)
-             - [Uniform Cost Issue](#be3a9de1eb8b7a58870eafd5232dc9ce)
-         - [The One Queue](#6fa04493ae42918af4621de6aae2ccc2)
-         - [DFS vs BFS vs UCS](#46ea5fe25e20e5c9f2466692baeb1848)
-     - [Search and Models](#7f1afff8243e3009eb892111dcc4413f)
-     - [Graph Search VS Tree Search](#f2ef45f33145362c2a215128cc677ccc)
-     - [Uniform cost search vs. Dijkstra's Algorithm](#e609c39a6581f06c0e176c5be71abfa3)
-     - [Some Hints for P1](#b04314d7dafd45796af0bf245e3ae8e8)
- - [Informed Search](#29990be19ae238ca1071a838229e85f3)
-     - [Search Heuristics](#fdb1b92add98d8aa548a1d33445c6a67)
-         - [Example](#0a52730597fb4ffa01fc117d9e71e3a9)
-     - [Greedy Search](#6f166f2a80c5f26b9e59a2ed903c09c7)
-     - [A* search](#4eb045a9450d6e7de8a9b8cb2e420c89)
-         - [Combining UCS and Greedy](#07e5a0c69feece254a168e7da5932151)
-         - [When should A* terminate?](#9fa7d37bafbf919eec2833224d5de03c)
-         - [Is A\* Optimal?](#ea311a4ecb13c55b4cd70a212419aeb9)
-         - [Admissible Heuristics](#bf8f38651446764fc008980354ad6746)
-         - [Optimality of A* Tree Search](#3073e988edee383f5983f6a7fc2212a2)
-         - [Properties of A*](#26e3cfa1ee4375a33dca3b380348e972)
-     - [Comparison](#f6c0e3a1c3cfabd32ae8d3ae741fcf0a)
-     - [Creating Heuristics](#042138393e72af1a16d8c31facd84ab1)
-         - [Example: 8 Puzzle](#f8097ec9827afc9065c89741a344d53f)
-     - [Semi-Lattice of Heuristics  半启发式](#7e9aa2fe208a956ac44d1ee31a5035d9)
-         - [Trivial Heuristics, Dominance](#30887de01fbff37aef091345781445d5)
-     - [Graph Search](#00ba899c02fa6651c15e5e948a7a4aac)
-         - [Tree Search: Extra Work!](#cf1432b4daa7e1fe63cecb1365185f0b)
-         - [Graph Search](#00ba899c02fa6651c15e5e948a7a4aac)
-         - [A* Graph Search Gone Wrong?](#9afaf22785328c0bf6267acf13add5da)
-         - [Consistency of Heuristics](#cb964f845fc822953ddb83ca6d124e6b)
-         - [Optimality of A* Graph Search](#ea9a7016fa68c3fd6434c9c0fb4afa3d)
-         - [Optimality](#c1e81f3c2f720c3a2e3a765ba6a11d59)
-     - [A*: Summary](#e418daaa73025a84fd16637fbf3b2d0d)
-         - [Graph Search Pseudo-Code](#1388b32869f8288febeb18f8ec802b42)
-         - [Optimality of A\* Graph Search](#53d3b2a00e84590355f57034c84cc1a0)
-     - [demo code in python](#c9f86c35957917fe5e25e926f8923c75)
-         - [ python graph search](#41ac4b4e9e2441a0a74f1372fbca3c52)
-         - [other implementation](#65e0ab6e34746c2231d34656e5134d92)
+- [AI , CS 188](#aea7deb258843dff16f9b84b46ec1461)
+- [Introduction](#0b79795d3efc95b9976c7c5b933afce2)
+    - [What is AI](#9fa835a40078a81e452b0cbb4362a6f5)
+    - [Designing Rational Agents](#04052b6bc5dad6a9f6a00dfb9cd988da)
+    - [Reflex Agents](#9ef57e59fc5834eb1f86775a80163590)
+    - [Planning Agents](#b35ab1adff6f2f91e25f048a1f1ecfcc)
+    - [Course Topics \*](#75947eb557ad99ec6bd6f19e5842e7c0)
+- [Uninformed Search](#faccc055dce5dfee94eba9a23ec379bc)
+    - [Search Problems](#fc72ba154e470ee2e177ed8e75ee4de2)
+    - [Search Problems Are Models](#0a9e0b58d3ed416bdb73713846200baa)
+        - [Example: Traveling in Romania](#30f0fbd7fae0ee74806b20a52d15e3ee)
+    - [What’s in a State Space ?](#e753d55f3a61b93cba852a33216321e0)
+    - [State Space Sizes ?](#05eb0fb2a7cf700d9734545149fc43fb)
+    - [Quiz: Safe Passage](#10f2374e81dfff89cef5eecf517b70ef)
+    - [State Space Graphs and Search Trees](#12227407175834cc50274fb425cf4e2d)
+        - [State Space Graphs](#91fa96e85b0a665a30ab89661d0137c4)
+        - [Search Trees](#fa3d63f947f57a28158a9af70e100ef3)
+        - [State Space Graphs vs. Search Trees](#3371ddd82f34162d684dfd1d1f40d8b3)
+        - [Quiz: State Space Graphs vs. Search Trees](#76acaf4079e010db2a41f612ceae95f4)
+        - [Searching with a Search Tree](#643025d557c3b9f6d43cdd62b77f5530)
+        - [General Tree Search](#a23c40de844ed1e2415dc477845012af)
+        - [Depth-First Search](#d292eaede65eb34e66db0db9ebb6b9bc)
+            - [Search Algorithm Properties](#6dda6174af1ce92b505f3c29643504c3)
+            - [Depth-First Search (DFS) Properties](#62a9189e6707b0db89f80a7a5bb6c15e)
+        - [Breadth-First Search](#ae5c4b868b5b24149decba70c74165c2)
+            - [Breadth-First Search (BFS) Properties](#0d9bfd747ee897d1720abf029faddae4)
+            - [Iterative Deepening](#fcbd892c255445e0e3c99ceeb0dbc2e9)
+        - [Cost-Sensitive Search](#ea10a2ff2bc1cbc4cb292e4f88cad9e9)
+            - [Uniform Cost Search](#1bd1e9029adb17c5893239e7288210a9)
+            - [Uniform Cost Search (UCS) Properties](#8fcce2120d7405462b72fce3bf1fcaaa)
+            - [Uniform Cost Issue](#be3a9de1eb8b7a58870eafd5232dc9ce)
+        - [The One Queue](#6fa04493ae42918af4621de6aae2ccc2)
+        - [DFS vs BFS vs UCS](#46ea5fe25e20e5c9f2466692baeb1848)
+    - [Search and Models](#7f1afff8243e3009eb892111dcc4413f)
+    - [Graph Search VS Tree Search](#f2ef45f33145362c2a215128cc677ccc)
+    - [Uniform cost search vs. Dijkstra's Algorithm](#e609c39a6581f06c0e176c5be71abfa3)
+    - [Some Hints for P1](#b04314d7dafd45796af0bf245e3ae8e8)
+- [Informed Search](#29990be19ae238ca1071a838229e85f3)
+    - [Search Heuristics](#fdb1b92add98d8aa548a1d33445c6a67)
+        - [Example](#0a52730597fb4ffa01fc117d9e71e3a9)
+    - [Greedy Search](#6f166f2a80c5f26b9e59a2ed903c09c7)
+    - [A* search](#4eb045a9450d6e7de8a9b8cb2e420c89)
+        - [Combining UCS and Greedy](#07e5a0c69feece254a168e7da5932151)
+        - [When should A* terminate?](#9fa7d37bafbf919eec2833224d5de03c)
+        - [Is A\* Optimal?](#ea311a4ecb13c55b4cd70a212419aeb9)
+        - [Admissible Heuristics](#bf8f38651446764fc008980354ad6746)
+        - [Optimality of A* Tree Search](#3073e988edee383f5983f6a7fc2212a2)
+        - [Properties of A*](#26e3cfa1ee4375a33dca3b380348e972)
+    - [Comparison](#f6c0e3a1c3cfabd32ae8d3ae741fcf0a)
+    - [Creating Heuristics](#042138393e72af1a16d8c31facd84ab1)
+        - [Example: 8 Puzzle](#f8097ec9827afc9065c89741a344d53f)
+    - [Semi-Lattice of Heuristics  半启发式](#7e9aa2fe208a956ac44d1ee31a5035d9)
+        - [Trivial Heuristics, Dominance](#30887de01fbff37aef091345781445d5)
+    - [Graph Search](#00ba899c02fa6651c15e5e948a7a4aac)
+        - [Tree Search: Extra Work!](#cf1432b4daa7e1fe63cecb1365185f0b)
+        - [Graph Search](#00ba899c02fa6651c15e5e948a7a4aac)
+        - [A* Graph Search Gone Wrong?](#9afaf22785328c0bf6267acf13add5da)
+        - [Consistency of Heuristics](#cb964f845fc822953ddb83ca6d124e6b)
+        - [Optimality of A* Graph Search](#ea9a7016fa68c3fd6434c9c0fb4afa3d)
+        - [Optimality](#c1e81f3c2f720c3a2e3a765ba6a11d59)
+    - [A*: Summary](#e418daaa73025a84fd16637fbf3b2d0d)
+        - [Graph Search Pseudo-Code](#1388b32869f8288febeb18f8ec802b42)
+        - [Optimality of A\* Graph Search](#53d3b2a00e84590355f57034c84cc1a0)
+    - [demo code in python](#c9f86c35957917fe5e25e926f8923c75)
+        - [ python graph search](#41ac4b4e9e2441a0a74f1372fbca3c52)
+        - [other implementation](#65e0ab6e34746c2231d34656e5134d92)
 
 ...menuend