Groovy Теоретически-практический ? про замыкания (Groovy)

order = ["X", "0", "0", "X", "X", "X", "0", "X", "X"]
V = 0; n = 3
def Vid = {it ->
           print it; print V
           if ((V+1)%n == 0) println() 
           ++V}
def Vvod_s () {print "Для выхода введите n => "; s = System.in.newReader().readLine()
}
Vid(order);  println("- - - -")
while (1) {
order = Poisk(order, n);  Vid(order)
Vvod_s (); if (s == "n") {break}
}

n = 3; q = 9
order = ["X", "0", "0", "X", "X", "X", "0", "X", "X"]
def Vid (n, q) {
  for (int i = 0; i < q; i++) {
      print("${order[i]} ")
    if ((i+1)%n == 0) {println()}  
  }  
}
def Vvod_s () {print "Для выхода введите n => "; s = System.in.newReader().readLine()
}
 Vid (n, q);  println("- - - -")
while (1) {
order = Poisk(order, n);  Vid (n, q)
Vvod_s (); if (s == "n") {break}
}

//Live1.groovy
package groovy
 
def Vvod() {print "Vvedite n = "; s = System.in.newReader().readLine(); n = s as Integer}
def Spisok() {
    order = []; q = n**2
    for (int i = 0; i < q; i++) {        
      T = Math.round(Math.random() * 1)
      if (T == 1) {order = order + "X"} else {order = order + "0"}
   }
      return order 
}
def Poisk() { 
    order1 = []
  for (int i = 0;i < q; i++) {
          Xs = 0; p = (i+1)%n     
    if (((f = i-n)   >= 0 &&           order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i-n+1) >= 0 && p != 0 && order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i+1)   <  q && p != 0 && order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i+n+1) <  q && p != 0 && order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i+n)   <  q &&           order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i+n-1) <  q && p != 1 && order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i-1)   >= 0 && p != 1 && order[f] == "X" && (Xs = Xs + 1)) |
        ((f = i-n-1) >= 0 && p != 1 && order[f] == "X" && (Xs = Xs + 1))) {             
      switch (Xs) {          
        case 2 : if (order[i] == "X") {order1 = order1 + "X"}
                                 else {order1 = order1 + "0"}; break
        case 3 : order1 = order1 + "X"; break        
        default: order1 = order1 + "0"
         }
      }    else {order1 = order1 + "0"} 
   }    
    return order1 
}
/*def Vid() {
    y = 0
  for (i in order) {
       print(i+" "); if ((y+1)%n == 0) println(); ++y
   }  
}*/
def Vvod_s() {print "Для выхода введите n => "; s = System.in.newReader().readLine()
}
y = 0
def T = {order.each{print it+" "; if ((y+1)%n == 0) println(); ++y}}
Vvod();  println();  Spisok(); T(order)
println("- - - -")
while (1) {
order = Poisk(); T(order)
Vvod_s(); if (s == "n") {break}
}

def T = {y = 0; order.each{print it+" "; if ((y+1)%n == 0) println(); ++y}}
/*def Vid() {y = 0; for (i in order) {print i+" "; if ((y+1)%n == 0) println(); ++y}}*/

def Y = {print it+" "; if ((y+1)%n == 0) println(); ++y}
def T = {y = 0; order.each(Y)}

//.............................................................................
for (int i = 0;i < q; i++) {
          Xs = 0; def U = {Xs = Xs + 1}
          p = (i+1)%n; def R0 = {p != 0}; def R1 = {p != 1}
          def W = {order[f] == "X"}
    if (((f = i-n)   >= 0 &&         W{} && U{}) |
        ((f = i-n+1) >= 0 && R0{} && W{} && U{}) |
        ((f = i+1)   <  q && R0{} && W{} && U{}) |
        ((f = i+n+1) <  q && R0{} && W{} && U{}) |
        ((f = i+n)   <  q &&         W{} && U{}) |
        ((f = i+n-1) <  q && R1{} && W{} && U{}) |
        ((f = i-1)   >= 0 && R1{} && W{} && U{}) |
        ((f = i-n-1) >= 0 && R1{} && W{} && U{})) {
//..............................................................................

def Poisk() { 
    order1 = []
    def W  = {order[f] == "X" && (Xs = Xs + 1)}
    def W0 = {p != 0 && W{}}; def W1 = {p != 1 && W{}}
    def X  = {order1 = order1 + "X"}; def O = {order1 = order1 + "0"}
  for (int i = 0;i < q; i++) {
          p = (i+1)%n; Xs = 0          
    if (((f = i-n)   >= 0 && W{})  |
        ((f = i-n+1) >= 0 && W0{}) |
        ((f = i+1)   <  q && W0{}) |
        ((f = i+n+1) <  q && W0{}) |
        ((f = i+n)   <  q && W{})  |
        ((f = i+n-1) <  q && W1{}) |
        ((f = i-1)   >= 0 && W1{}) |
        ((f = i-n-1) >= 0 && W1{})) {             
      switch (Xs) {          
        case 2 : if (order[i] == "X") {X{}} else {O{}}; break
        case 3 : X{}; break        
        default: O{}
         }
      }    else {O{}} 
   }    
    return order1 
}