1.

dependency-based search tree 1st Dependency Stage

aabcdeabcdbcdeabcdee

bbcdeabcdbcdeabcdee ebcdeabcdbcdeabcdee aabcdeabcdbcdeabcda aabcdeabcdbcdeabcdd

acdeabcdbcdeabcdee ccdeabcdbcdeabcdee aabcdeabcdbcdeabcc aabcdeabcdbcdeabce

ddeabcdbcdeabcdee bdeabcdbcdeabcdee aabcdeabcdbcdeabd aabcdeabcdbcdeabb

aabcdeabcdbcdeaa aabcdeabcdbcdeac
ceabcdbcdeabcdee eeabcdbcdeabcdee

dabcdbcdeabcdee aabcdbcdeabcdee aabcdeabcdbcdee aabcdeabcdbcdeb

bbcdbcdeabcdee ebcdbcdeabcdee aabcdeabcdbcda aabcdeabcdbcdd

ccdbcdeabcdee acdbcdeabcdee aabcdeabcdbce aabcdeabcdbcc

aabcdeabcdbb aabcdeabcdbd
bdbcdeabcdee ddbcdeabcdee

cbcdeabcdee ebcdeabcdee aabcdeabcda aabcdeabcdc

 1. dependency-based search tree 1st Combination Stage

aabcdeabcdbcdeabcdee

bbcdeabcdbcdeabcdee ebcdeabcdbcdeabcdee aabcdeabcdbcdeabcda aabcdeabcdbcdeabcdd

acdeabcdbcdeabcdee ccdeabcdbcdeabcdee aabcdeabcdbcdeabcc aabcdeabcdbcdeabce

ddeabcdbcdeabcdee bdeabcdbcdeabcdee aabcdeabcdbcdeabd aabcdeabcdbcdeabb

aabcdeabcdbcdeaa aabcdeabcdbcdeac
ceabcdbcdeabcdee eeabcdbcdeabcdee

dabcdbcdeabcdee aabcdbcdeabcdee aabcdeabcdbcdee aabcdeabcdbcdeb

bbcdbcdeabcdee ebcdbcdeabcdee aabcdeabcdbcda aabcdeabcdbcdd

ccdbcdeabcdee acdbcdeabcdee aabcdeabcdbce aabcdeabcdbcc

aabcdeabcdbb aabcdeabcdbd
bdbcdeabcdee ddbcdeabcdee

cbcdeabcdee ebcdeabcdee aabcdeabcda aabcdeabcdc

特寫這塊來看
 ebcdeabcdee aabcdeabcda aabcdeabcdc
cbcdeabcdee

cc
1. dependency-based search tree 2nd Dependency Stage

ebcdeabcdee aabcdeabcda aabcdeabcdc

cbcdeabcdee

cc

b d
 1. DFS without transposition table

（這張圖逗號左邊代表的是最左邊的兩個字母，右邊代表的是最右邊的兩個字母）
由這張圖可以發現：
4 的下面是 2, 4, 4, 2
2 的下面是 0, 2

因此在前 9 步每次分支的期望值為 ×2+ ×4+ ×0=

後 9 步因為沒有 4 的分支了，因此機率就加到 2 的分支上，期望值為： × 2 + × 0 =

而後 9 步的 root 為第 9 步，第 9 步大約有 個 node

因此 node 數的期望值為 ∑ + ×∑ = 5.071 × 10 個

1. DFS with transposition table

平均來說，depth大約可以減少一半（可以拿深度超過一半的來補那些沒展開的 node，讓上面一半的 tree 填滿，下面一半的 tree 是

空的）。
.
. .
因此 node 數的期望值為 ∑ + ×∑ = 811 個
2. Consider the Gomoku game. For the lower left case, where Black to move, depict its λ1-tree and also evaluate its value.
2. For the lower right case, where Black to move and to win, depict its λ2-tree.
3.
Defender λ2-moves: Attacker λ2-moves: