xwjdsh / 2048-ai Goto Github PK

func (a *AI) Search() grid.Direction {
	var (
		bestDire  = grid.NONE
		bestScore float64
	)
	// depth value depending on grid's max value.
	dept := a.deptSelect()
	for _, dire := range directions {
		newGrid := a.Grid.Clone()
		if newGrid.Move(dire) {.     **//It No Caculate  score generated by Move.**
			// Could move.
			// Active is false represent computer should fill number to grid now.

			newAI := &AI{Grid: newGrid, Active: false}
			if newScore := newAI.expectSearch(dept); newScore > bestScore {
				bestDire = dire
				bestScore = newScore
			}
		}
	}
	return bestDire
}

func (g *Grid) Move(d Direction) (bool, float64) {
	originData := g.Data
	data := &g.Data
	Score := float64(0)
	switch d {
	case UP:
		for y := 0; y < 4; y++ {
			for x := 0; x < 3; x++ {
				for nx := x + 1; nx <= 3; nx++ {
					if data[nx][y] > 0 {
						if data[x][y] <= 0 {
							data[x][y] = data[nx][y]
							data[nx][y] = 0
							x -= 1
						} else if data[x][y] == data[nx][y] {
							data[x][y] += data[nx][y]
							data[nx][y] = 0
							Score += float64(data[x][y] * 2)
						}
						break
					}
				}
			}
		}
	case DOWN:
		for y := 0; y < 4; y++ {
			for x := 3; x > 0; x-- {
				for nx := x - 1; nx >= 0; nx-- {
					if data[nx][y] > 0 {
						if data[x][y] <= 0 {
							data[x][y] = data[nx][y]
							data[nx][y] = 0
							x += 1
						} else if data[x][y] == data[nx][y] {
							data[x][y] += data[nx][y]
							data[nx][y] = 0
							Score += float64(data[x][y] * 2)
						}
						break
					}
				}
			}
		}
	case LEFT:
		for x := 0; x < 4; x++ {
			for y := 0; y < 3; y++ {
				for ny := y + 1; ny <= 3; ny++ {
					if data[x][ny] > 0 {
						if data[x][y] <= 0 {
							data[x][y] = data[x][ny]
							data[x][ny] = 0
							y -= 1
						} else if data[x][y] == data[x][ny] {
							data[x][y] += data[x][ny]
							data[x][ny] = 0
							Score += float64(data[x][y] * 2)
						}
						break
					}
				}
			}
		}
	case RIGHT:
		for x := 0; x < 4; x++ {
			for y := 3; y > 0; y-- {
				for ny := y - 1; ny >= 0; ny-- {
					if data[x][ny] > 0 {
						if data[x][y] <= 0 {
							data[x][y] = data[x][ny]
							data[x][ny] = 0
							y += 1
						} else if data[x][y] == data[x][ny] {
							data[x][y] += data[x][ny]
							data[x][ny] = 0
							Score += float64(data[x][y] * 2)
						}
						break
					}
				}
			}
		}
	}
	return utils.Diff(*data, originData), Score
}

 //优化后的Search函数
func (a *AI) Search() grid.Direction {
	var (
		bestDire  = grid.NONE
		bestScore float64
	)
	// depth value depending on grid's max value.
	// 根据场上最大分数来判断搜索深度
dept := a.deptSelect()
	for _, dire := range directions {
		newGrid := a.Grid.Clone()
       
		canmove, score := newGrid.Move(dire)
		if canmove {
               if bestDire == grid.NONE {
				bestDire = dire
			}
			// Could move.
			// Active is false represent computer should fill number to grid now.
			newAI := &AI{Grid: newGrid, Active: false}
			if newScore := newAI.expectSearch(dept); newScore+score > bestScore {
				bestDire = dire
				bestScore = newScore
			}

		}
	}

	return bestDire