用go写的五子棋预测算法的实现

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
const( 
  matrix = 50*50 
  point = 3 
) 
  type Coordinat struct{
    x  int
    y  int
  }

type Allinat struct{
  key   []Coordinat
}

func InArray(need Coordinat, needArr []Coordinat) bool {
  for _,v := range needArr{
    if need == v{
      return true
    }
  }
  return false
}

func inverted(tmp []int) bool {   //倒序检查
  var i int
  for k := len(tmp)-1; k>=0;k--{
    if k == 0{         //最后一个下标说明无法对比
      return false
    }
    if tmp[k]-1 == tmp[k]{   //说明值是连续数字
      i++
      if i == point{     //如果达到连续数就返回
        return true
      }
    }else{
      return false
    }
  }
  return false
}

func postive(tmp []int) bool {   //正序检查
  var i int
  for ck, cv := range tmp {
    if ck == len(tmp)-1{    //最后一个下标说明无法对比
      return false
    }
    if cv+1 == tmp[ck+1] {   //说明值是连续数字
      i++
      if i == point{     //如果达到连续数就返回
        return true
      }
    }else{
      return false
    }
  }
  return false
}

func Slope(inat *Allinat,coor Coordinat) bool {
  var (
    Xmax,Xmin int = coor.x+4,coor.x-4
    Ymax,Ymin int = coor.y+4,coor.y-4
    j,p   int
    lrise,lfall Coordinat
    //tmp []int
  )
  if Xmin < 0 {
    Xmin = 0
  }
  if Ymin < 0 {
    Ymin = 0
  }
  for i:=Xmin; i<=Xmax; i++{
    Xmin = Xmin+1
    Ymin = Ymin+1
    lrise.x = Xmin
    lrise.y = Ymin
    if InArray(lrise,inat.key) {
      j++
      //fmt.Println(lrise,j)
      if j == point{
        return true
      }
    }

    if Ymin == Ymax {
      break
    }
  }
  for ii := Xmax; ii>=Xmin; ii--{
    Xmax = Xmax-1
    Ymin = Ymin+1
    lfall.x = Xmax
    lfall.y = Ymin

    if InArray(lfall,inat.key) {
      p++
      //fmt.Println(lfall,p)
      if p == point{
        return true
      }
    }
    if Ymin == Ymax {
      return false
    }
  }
  return false

}

func lengthways(inat *Allinat,coor Coordinat) bool {
  var (
    max,min int = coor.x+4,coor.x-4
    tmp []int
  )
  if min < 0 {
    min = 0
  }
  for _,c := range inat.key{
    if (max >= c.x && c.y == coor.y) || (min >= c.x && c.y == coor.y){
      tmp = append(tmp,c.x)
    }
  }
  sort.Ints(tmp)
  if (inverted(tmp) == true) || (postive(tmp) == true) {
    return true
  }
  return false
}

func crosswise(inat *Allinat,coor Coordinat) bool {
  var (
    max,min int = coor.y+4,coor.y-4
    tmp []int
  )
  for _,c := range inat.key{
    if (max >= c.y && c.x == coor.x) || (min >= c.y && c.x == coor.x){
      tmp = append(tmp,c.y)
    }
  }
  sort.Ints(tmp)
  if (inverted(tmp) == true) || (postive(tmp) == true) {
    return true
  }
  return false
}

func IsFive(inat *Allinat,coor Coordinat) bool {
  ok := crosswise(inat,coor)
  ok2 := lengthways(inat,coor)
  ok3 := Slope(inat,coor)
  //slope(inat)
  if ok == true || ok2 == true || ok3 == true{
    return true
  }
  return false
}

func (inat *Allinat)AddCoordinat(coor Coordinat){
  for _,coslice := range inat.key{
    if coslice == coor {
      return 
    }
  }
  c := IsFive(inat,coor)
  fmt.Println(c,"*****",coor)
  if c == false{   //not finish five
    inat.key = append(inat.key,coor)
    fmt.Println("没有连成")
    return 
  }
  fmt.Println("连成point颗")
  return 

}