A星寻路算法 cocos2d-js

其他 2018-07-30 19:53:47 阅读次数: 0

把A星算法研究了下，自己用cocos2d-js实现了一次，代码如下：


效果如图


var layer = new cc.LayerColor(cc.color(0, 0, 0, 127), cc.winSize.width, cc.winSize.height);
// var layer = new cc.LayerColor(cc.color(0, 0, 0, 127), cc.winSize.width, cc.winSize.height);
this.addChild(layer);
var label1 = new cc.LabelTTF('hello world', "Arial", 38);
label1.setPosition(cc.winSize.width/2, cc.winSize.height/2);
label1.setColor(cc.color(0,200,200));
label1.setString("winSize.width, cc.winSize.height =  " + cc.winSize.width + "  " + cc.winSize.height);
this.addChild(label1);

var MapAtr = [
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],//5
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[1],[1],[1],[1],[1],[1],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],//10
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
    [[0],[0],[0],[0],[0],[0],[0],[0],[0]],
];
var MapNode = [];
var openList = [];
var closeList = [];
var resultList = [];

var index = 0;
for(var i=0; i<16; i++){
    for(var j=0; j<9; j++){
        var length = MapNode.length;
        var _layer = new cc.LayerColor(cc.color(255/25*i, 255/25*j, 255/25*(i+j)/2), cc.winSize.width/16, cc.winSize.height/9);
        _layer.setPosition(i*cc.winSize.width/16, cc.winSize.height/9*j);
        _layer.setName('layer' + (i*100 + j));
        if(MapAtr[i][j][0]){
            _layer.setColor(cc.color(0,0,0));
        }
        var userData = {};
        userData.i=i;
        userData.j = j;
        userData.from=false;
        userData.end=false;
        userData.F = 0;
        userData.G = 0;
        userData.label = '';
        userData.color = cc.color(255/25*i, 255/25*j, 255/25*(i+j)/2);
        userData.arrived = false;
        _layer.setUserData(userData);
        this.addChild(_layer);
        var _label = new cc.LabelTTF('', "Arial", 20);
        _layer.addChild(_label);
        _label.setName('stringLabel');
        // _label.setString(index++);
        _label.setTag(i+100+j);
        _label.setPosition(cc.winSize.width/16/2, cc.winSize.height/9/2);
        // _label.setString((i*100+j).toString());
        MapNode[length] = _layer;
    }
}

var StartNode = null;
var EndNode = null;
var chupaiListener = cc.EventListener.create({
    event: cc.EventListener.TOUCH_ONE_BY_ONE,
    swallowTouches: true,
    onTouchBegan: function (touch, event) {
        if(!StartNode){
            for(var i=0; i<MapNode.length; i++){
                if(TouchUtils.isTouchMe(MapNode[i], touch, event, null)){
                    var userData = MapNode[i].getUserData();
                    userData.label = "Start";
                    userData.from = true;
                    userData.G = 0;
                    userData.F = 0;
                    userData.H = 0;
                    StartNode = MapNode[i];
                    StartNode.getChildByName('stringLabel').setString('Start');
                    break;
                }
            }
        } else if(!EndNode) {
            for(var i=0; i<MapNode.length; i++){
                if(MapNode[i] == StartNode){
                    continue;
                }
                if(TouchUtils.isTouchMe(MapNode[i], touch, event, null)){
                    var userData = MapNode[i].getUserData();
                    EndNode = MapNode[i];
                    userData.label = "End";
                    userData.end = true;
                    EndNode.getChildByName('stringLabel').setString('End');
                    break;
                }
            }
        } else if(!that.hasCalc){
            that.hasCalc = true;
            // 计算
            var paseList = astart(StartNode, EndNode);
            if(paseList){
                findPath(EndNode);
                if(resultList.length){
                    console.log('======resultList.length' + resultList.length);
                    for(var i=0; i<resultList.length; i++){
                        var __node = resultList[i];
                        __node.setColor(cc.color(255, 255, 255));
                    }
                }
            }
        } else {
            that.hasCalc = false;
            clearSelectNode();
        }

        return false;
    },
    onTouchMoving: function (touch, event) {

    },
    onTouchEnd: function (touch, event) {

    },
});
that.chupaiListener = chupaiListener;
cc.eventManager.addListener(chupaiListener, layer);

var inCloseList = function(curNode){
    for(var i=0; i<closeList.length; i++){
        if(closeList[i] == curNode)
            return true;
    }
    return false;
};
var isInOpenList = function(curNode){
    for(var i=0; i<openList.length; i++){
        if(openList[i] == curNode)
            return true;
    }
    return false;
};
var calcNodeGHF = function(curNode){

};
var initOpenList = function(){
    openList = [];
    openList.push(StartNode);
};
//G 为 start 到当前的耗费， H 为当前到 end 的耗费
var searceCanArrivedList = function(curNode, EndNode, indexOfOpen){
    console.log('==============indeOf  calc === ' + indexOfOpen);
    var curX = curNode.getUserData().i;
    var curY = curNode.getUserData().j;
    var endX = EndNode.getUserData().i;
    var endY = EndNode.getUserData().j;
    closeList.push(curNode);
    openList.splice(0, 1);
    if(MapNode[(curX-1)*9+curY] == EndNode){
        EndNode.Parent = curNode;
        return true;
    }
    if(MapNode[(curX-1)*9+curY] && MapAtr[curX-1][curY] && !MapAtr[curX-1][curY][0] && !inCloseList(MapNode[(curX-1)*9+curY])){
        // 判断点是不是在 openlist 里面
        if(!isInOpenList(MapNode[(curX-1)*9 + curY])){
            openList.push(MapNode[(curX-1)*9 + curY]);
            MapNode[(curX-1)*9+curY].getUserData().G = curNode.getUserData().G + 1;
            MapNode[(curX-1)*9+curY].getUserData().H = Math.abs(endX - MapNode[(curX-1)*9+curY].getUserData().i) + Math.abs(endY - MapNode[(curX-1)*9+curY].getUserData().j);
            MapNode[(curX-1)*9+curY].getUserData().F = MapNode[(curX-1)*9+curY].getUserData().G + MapNode[(curX-1)*9+curY].getUserData().H;
            MapNode[(curX-1)*9+curY].getUserData().arrived = true;
            MapNode[(curX-1)*9+curY].getChildByName('stringLabel').setString('k' + (indexOfOpen*10 + 1));
            MapNode[(curX-1)*9+curY].Parent = curNode;
        }
    }
    if(MapNode[(curX+1)*9+curY] == EndNode){
        EndNode.Parent = curNode;
        return true;
    }
    if(MapNode[(curX+1)*9+curY] && MapAtr[curX+1][curY] && !MapAtr[curX+1][curY][0] && !inCloseList(MapNode[(curX+1)*9+curY])){
        if(!isInOpenList(MapNode[(curX + 1) * 9 + curY])) {
            openList.push(MapNode[(curX + 1) * 9 + curY]);
            MapNode[(curX + 1) * 9 + curY].getUserData().G = curNode.getUserData().G + 1;
            MapNode[(curX + 1) * 9 + curY].getUserData().H = Math.abs(endX - MapNode[(curX + 1) * 9 + curY].getUserData().i) + Math.abs(endY - MapNode[(curX + 1) * 9 + curY].getUserData().j);
            MapNode[(curX + 1) * 9 + curY].getUserData().F = MapNode[(curX + 1) * 9 + curY].getUserData().G + MapNode[(curX + 1) * 9 + curY].getUserData().H;
            MapNode[(curX + 1) * 9 + curY].getUserData().arrived = true;
            MapNode[(curX + 1) * 9 + curY].getChildByName('stringLabel').setString('K' + (indexOfOpen * 10 + 2));
            MapNode[(curX + 1) * 9 + curY].Parent = curNode;
        }
    }
    if(MapNode[curX*9+curY+1] == EndNode){
        EndNode.Parent = curNode;
        return true;
    }
    if(MapNode[curX*9+curY+1] && MapAtr[curX][curY+1] && !MapAtr[curX][curY+1][0] && !inCloseList(MapNode[curX*9+curY+1])){
        if(!isInOpenList(MapNode[curX * 9 + curY + 1])) {
            openList.push(MapNode[curX * 9 + curY + 1]);
            MapNode[curX * 9 + curY + 1].getUserData().G = curNode.getUserData().G + 1;
            MapNode[curX * 9 + curY + 1].getUserData().H = Math.abs(endX - MapNode[curX * 9 + curY + 1].getUserData().i) + Math.abs(endY - MapNode[curX * 9 + curY + 1].getUserData().j);
            MapNode[curX * 9 + curY + 1].getUserData().F = MapNode[curX * 9 + curY + 1].getUserData().G + MapNode[curX * 9 + curY + 1].getUserData().H;
            MapNode[curX * 9 + curY + 1].getUserData().arrived = true;
            MapNode[curX * 9 + curY + 1].getChildByName('stringLabel').setString('K' + (indexOfOpen * 10 + 3));
            MapNode[curX * 9 + curY + 1].Parent = curNode;
        }
    }
    if(MapNode[curX*9+curY-1] == EndNode){
        EndNode.Parent = curNode;
        return true;
    }
    if(MapNode[curX*9+curY-1] && MapAtr[curX][curY-1] &&!MapAtr[curX][curY-1][0] && !inCloseList(MapNode[curX*9+curY-1])){
        if(!isInOpenList(MapNode[curX * 9 + curY - 1])) {
            openList.push(MapNode[curX * 9 + curY - 1]);
            MapNode[curX * 9 + curY - 1].getUserData().G = curNode.getUserData().G + 1;
            MapNode[curX * 9 + curY - 1].getUserData().H = Math.abs(endX - MapNode[curX * 9 + curY - 1].getUserData().i) + Math.abs(endY - MapNode[curX * 9 + curY - 1].getUserData().j);
            MapNode[curX * 9 + curY - 1].getUserData().F = MapNode[curX * 9 + curY - 1].getUserData().G + MapNode[curX * 9 + curY - 1].getUserData().H;
            MapNode[curX * 9 + curY - 1].getUserData().arrived = true;
            MapNode[curX * 9 + curY - 1].getChildByName('stringLabel').setString('K' + (indexOfOpen * 10 + 4));
            MapNode[curX * 9 + curY - 1].Parent = curNode;
        }
    }

    //判断当前的openList的 F 值最小
    if(openList.length){
        var _F = openList[0].getUserData().F;
        var _idx = 0;
        for(var i=0; i<openList.length; i++){
            if(openList[i].getUserData().F < _F){
                _F = openList[i].getUserData().F;
                _idx = i;
            }
        }
        if(_idx != 0){
            var tem = openList[0];
            openList[0] = openList[_idx];
            openList[_idx] = tem;
        }
    }
    return false;
};
var findPath = function(EndNode){
    resultList.push(EndNode);
    var node = EndNode.Parent;
    while(node.Parent){
        resultList.push(node);
        node = node.Parent;
    }
    // Start 节点要不要添加进去？
}
var astart = function(StartNode, EndNode){
    initOpenList(StartNode);
    var indexOfOpen = 0;
    var result = searceCanArrivedList(StartNode, EndNode, indexOfOpen++);
    if(!result){
        while(openList.length) {
            result = searceCanArrivedList(openList[0], EndNode, indexOfOpen++);
            if(result){
                return true;
            }
        }
    }
    return result;
};
var clearSelectNode = function(){
    StartNode = null;
    EndNode = null;
    openList = [];
    resultList = [];
    closeList = [];
    for(var i=0; i<MapNode.length; i++){
        var userData = MapNode[i].getUserData();
        MapNode[i].getChildByName('stringLabel').setString('');
        if(MapAtr[userData.i][userData.j][0]){
            MapNode[i].setColor(cc.color(0,0,0));
        } else {
            MapNode[i].setColor( userData.color );
        }
        if(MapNode[i].Parent)
            MapNode[i].Parent = null;
        if(userData.G)
            userData.G = 0;
        if(userData.F)
            userData.F = 0;
        if(userData.H)
            userData.H = 0;
        if(userData.arrived)
            userData.arrived = false;
        if(userData.from)
            userData.from = 0;
        if(userData.label)
            userData.label = '';
    }
}



猜你喜欢

转载自blog.csdn.net/w_han__/article/details/79460703
今日推荐
Arc Browser for Windows 1.0 正式 GA
90后程序员开发视频搬运软件、不到一年获利超 700 万，结局很刑！
《美国对全球网络空间安全与发展的威胁和破坏》报告发布
火速冲上 GitHub 热榜 —— 开源编程语言、框架哪有这么可爱？
北京人形机器人创新中心发布全球首个纯电驱拟人奔跑的全尺寸人形机器人“天工”
周排行
rbac——界面、权限
Apache CXF + SpringMVC 整合发布WebService
so插件化
Vue.js实战系列---图标字体制作（svg格式）
PAT乙级 1007 素数对猜想(孪生素数对) (20分) ---（C语言 + 详细注释）
被IRM保护的文档，打开失败
Calendar和Date计算日期差的小问题
win10子系统ubuntu18.4安装docker
利用Wrap Shell Script定位Android Native内存泄漏
MySQL: Transaction (Part I - Basic Concept)
每日归档
更多
2024-05-03(19)
2024-05-02(0)
2024-05-01(4)
2024-04-30(1)
2024-04-29(40)
2024-04-28(0)
2024-04-27(56)
2024-04-26(39)
2024-04-25(22)
2024-04-24(36)

代码天地 © 2018 codetd.com

境外服务器   最新电视剧2022