绝知此事要躬行

原创 分治 Divide and Conquer 局部最小值 local optimal 棋盘问题

问题描述：Suppose now that you're given an  n × n grid graph $G$. (An n × n graph is just the adjacency graph of an $n \times n$ chessboard. To be completely precise, it is a graph whose node set is the