群体智能算法-黏菌寻找食物最优路线行为模拟

package main

import (
    "fmt"
    "sync"
    "time"
)

func main() {
    for {
        select {}
    }

}

var max_x int = 10
var max_y int = 10

var AllPart []Parts

type Parts []*Part

var lock *sync.RWMutex

func Print() {
    tick := time.Tick(1 * time.Second)
    for {
        select {
        case <-tick:
            fmt.Println("-------------------------------------------------")
            lock.Lock()
            for y := 0; y < max_y; y++ {
                for x := 0; x < max_x; x++ {
                    fmt.Printf("%d,%d,%d\t", AllPart[y][x].en, AllPart[y][x].food, AllPart[y][x].countfood)
                }
                fmt.Println()
            }
            lock.Unlock()
        }
    }
}

func init() {
    lock = &sync.RWMutex{}
    AllPart = make([]Parts, max_y, max_y)
    for y := 0; y < max_y; y++ {
        AllPart[y] = Parts(make([]*Part, max_x, max_x))
    }

    for y := 0; y < max_y; y++ {
        for x := 0; x < max_x; x++ {
            AllPart[y][x] = NewPart(x, y)
        }
    }

    AllPart[8][3].en = 10
    AllPart[8][3].ismother = true

    AllPart[3][8].food = 5000
    AllPart[3][8].isfood = true

    for y := 0; y < max_y; y++ {
        for x := 0; x < max_x; x++ {
            go AllPart[y][x].run()
        }
    }

    go Print()

}

type Part struct {
    x    int
    y    int
    en   int
    food int

    countfood int

    ismother bool
    isfood   bool
}

func NewPart(x, y int) *Part {
    p := Part{x, y, 0, 0, 0, false, false}
    return &p
}

func getEn(x, y int) int {
    if x < 0 || y < 0 {
        return -1
    }
    if x >= max_x || y >= max_y {
        return -1
    }

    return AllPart[y][x].en
}

func (p *Part) run() {
    tick := time.Tick(1 * time.Second)

    for !p.ismother {
        select {
        case <-tick:
            func() {
                lock.RLock()
                defer lock.RUnlock()

                max_node := 0
                maxcount := 0
                other := make(map[*Part]int)

                getmax := func(xi, yi int) {
                    en := getEn(xi, yi)
                    if en > p.en {
                        maxcount++
                        other[AllPart[yi][xi]] = en
                    }

                    if en > max_node {
                        max_node = en
                    }

                }
                getmax(p.x-1, p.y-1)
                getmax(p.x, p.y-1)
                getmax(p.x+1, p.y-1)

                getmax(p.x-1, p.y)
                getmax(p.x+1, p.y)

                getmax(p.x-1, p.y+1)
                getmax(p.x, p.y+1)
                getmax(p.x+1, p.y+1)

                if max_node > p.en {
                    p.en = max_node - 1
                }

                if p.en == 0 || p.food <= 0 || maxcount <= 0 {
                    return
                }

                food := p.food

                if p.isfood {
                    food = 8
                }

                avf := food / maxcount
                for k, _ := range other {
                    k.food += avf
                    p.countfood += avf
                    p.food -= avf
                }

            }()

        }
    }
}