| 节点 | A(m,n) | 动作 | 节点值 | 备注 |
| 1 | A(1,2) |
|
|
|
| 2 | A(1,1) |
|
|
|
| 3 | A(1,0) | 执行t2树 | 2 | 接收t2树返回值 |
| H2 | A(1,1) |
| a = 2 | 回溯节点2 |
| 4 | A(0,2) | n + 1 = 3 | b = 3 |
|
| H2 | A(1,1) |
| b = 3 | 回溯节点2 |
| H1 | A(1,2) |
| 3 | 回溯节点1，搜索右分支 |
| 5 | A(0,3) | n + 1 = 4 | b = 4 |
|
| H1 | A(1,1) |
| 4 | 回溯根节点1，搜索结束 |