GO | 八数码（DFS）

package main

import (
	"fmt"
	"reflect"
)

var directions = [4][2]int{{0, -1}, {0, 1}, {1, 0}, {0, 1}}

func main() {
	matrix := [3][3]int{{1, 2, 3}, {8, 0, 4}, {7, 6, 5}}
	target := [3][3]int{{1, 3, 4}, {8, 6, 2}, {7, 0, 5}}
	eightDigtalSolution(matrix, target)
}

func eightDigtalSolution(matrix, target [3][3]int) {
	memo := make(map[string]bool, 0)
	path := make([]string, 0)
	dfs(matrix, target, path, memo)
}

func dfs(matrix, target [3][3]int, path []string, memo map[string]bool) {
	// Found a solution
	if reflect.DeepEqual(matrix, target) {
		for i := range path {
			fmt.Printf("%v\t", path[i])
		}
		path = path[:0]
		return
	}
	status := serialization(matrix)
	// Has been Searched
	if _, ok := memo[status]; !ok {
		return
	}
	// Marking Searched
	memo[status] = true
	// Recursion
	zeroX, zeroY := findZeroIdx(matrix)
	// Move in fourth directions
	for _, dir := range directions {
		exchangeX, exchangeY := zeroX+dir[0], zeroY+dir[1]
		if isArea(exchangeX, exchangeY) {
			matrix[zeroX][zeroY], matrix[exchangeX][exchangeY] = matrix[exchangeX][exchangeY], matrix[zeroX][zeroY]
			// Push status
			path = append(path, serialization(matrix))
			dfs(matrix, target, path, memo)
			// Pop status
			path = path[:len(path)-1]
		}
	}

}
func isArea(x, y int) bool {
	if x >= 0 && x < 3 && y >= 0 && y < 3 {
		return true
	}
	return false
}
func findZeroIdx(matrix [3][3]int) (zeroX, zeroY int) {
	for i := range matrix {
		for j := range matrix[i] {
			if matrix[i][j] == 0 {
				zeroX, zeroY = i, j
			}
		}
	}
	return
}

func serialization(matrix [3][3]int) string {
	serialization := ""
	for i := range matrix {
		serialization += fmt.Sprintf("%d %d %d\n", matrix[i][0], matrix[i][1], matrix[i][2])
	}
	return serialization
}