{"id":1047,"date":"2014-03-03T08:50:04","date_gmt":"2014-03-03T01:50:04","guid":{"rendered":"http:\/\/blog.bebensiganteng.com\/?p=1047"},"modified":"2016-03-14T08:21:16","modified_gmt":"2016-03-14T08:21:16","slug":"game-development-journal-part-1","status":"publish","type":"post","link":"https:\/\/rahmat-hidayat.com\/?p=1047","title":{"rendered":"Game Development – part 1"},"content":{"rendered":"

Starting on my own game, although brilliant idea is immensely dependent on how the stars are aligned (metaphorical speaking obviously) still I can’t disclose the exact concept since the indie game scenery is notoriously brutal<\/a>, but in a glimpse the basic premise is a maze with a few added twists.
\n\u3058\u3083\u3042\u3001\u3044\u304d\u307e\u3057\u3087\u3046\u30fc\uff01 <\/p>\n

Choosing the Framework<\/h5>\n

There were candidates, which were<\/p>\n

    \n
  1. oF<\/a>, because of Ridiculous Fishing<\/a>.<\/li>\n
  2. cocos2D<\/a>, because of Badland<\/a><\/li>\n
  3. Native, because of iOS7<\/a><\/li>\n
  4. and lastly cocos2d-x<\/a>, because its porting capabilities<\/li>\n<\/ol>\n

    At the end I have chosen cocos2d-x because mobile != iOS, although hindsight native was perhaps a better choice since cocos2d-x is inferior in comparison with iOS 7, its laden with flaws such as the documentation, slow update, and mainly performance, on dormant the CPU usage hovers around 16%<\/p>\n

    \"Screenshot\"
    \nas native, it can go as low as 5%.<\/p>\n

    Although this is just my opinion, a diehard cocos2d-x user might argue au contraire<\/em>.<\/p>\n

    Development<\/h5>\n

    First phase is building the maze-generator, there a lot of maze algorithm<\/a> out there and some uses fancy algorithm such as Gabriel Graph<\/a>, Relative neighborhood graph<\/a>, or Normal distribution<\/a> but I chose Depth-first search<\/a> since the game has to be simple and fast.<\/p>\n

    \r\n\/**\r\n\r\nBuild an empty maze\r\n\r\n*\/\r\nvoid MazeGenerator::addInit() {\r\n    \r\n    int i;\r\n    \r\n    for (i = 0; i < _total; i++) {\r\n        \r\n        \/\/ _w is width of the tiles\r\n        int flag = EMPTY, nh = i\/_w;\r\n        \r\n        if (i < _w || i > _total-_w-1 || i%_w == 0 || i%(_w*(nh+1)-1) == 0 || (i%2 != 0 && nh%2 != 0)) {\r\n            flag = WALL;\r\n        }\r\n        \r\n        if (_start < 0 && flag == EMPTY) {\r\n            _start = i;\r\n            \r\n            \/\/ TODO randomize start position\r\n            flag = START;\r\n        }\r\n        \r\n        if (flag != EMPTY) _empty--;\r\n        \r\n        _stage->addObject(CCInteger::create(flag));\r\n        \r\n    }\r\n}\r\n\r\n\/**\r\n\r\nAdd the Depth-first search\r\n\r\n*\/\r\nvoid MazeGenerator::addDepthSearch() {\r\n    \r\n    CCArray* stack = CCArray::create();\r\n    CCInteger* p;\r\n    CCInteger* q;\r\n    \r\n    int s = _start;\r\n    \r\n    while (_path < _empty) {\r\n        \r\n        \/\/ Check for any surrounding empty tiles\r\n        CCArray* r = checkSurrounding(_stage, s, EMPTY);\r\n        \r\n        \/\/ If exists\r\n        if (r->count() > 0) {\r\n            \r\n            p = dynamic_cast<CCInteger *>(r->objectAtIndex(rand()%r->count()));\r\n            \r\n            _stage->replaceObjectAtIndex(p->getValue(), CCInteger::create( PATH ));\r\n            s = p->getValue();\r\n            \r\n            \/\/ TODO randomize end position\r\n            if (_end < s) _end = s;\r\n            \r\n            stack->addObject(p);\r\n            \r\n            _deadend = 1;\r\n            \r\n            _path++;\r\n            \r\n        } else {\r\n            \r\n            \/\/ Add a cul-de-sac\r\n            if (_deadend > 0) {\r\n                \r\n                q = dynamic_cast<CCInteger *>( stack->lastObject());\r\n                \r\n                _stage->replaceObjectAtIndex(q->getValue(), CCInteger::create( WALL ));\r\n                \r\n                _deadend = -1;\r\n            }\r\n            \r\n            \/\/ if cul-de-sac reached, step back \r\n            stack->removeLastObject();\r\n            p = dynamic_cast<CCInteger *>( stack->lastObject());\r\n            \r\n            s = p->getValue();\r\n        }\r\n        \r\n    }\r\n    \r\n}\r\n<\/pre>\n
    And here’s the result<\/p>\n
    \r\n\r\n\/\/ 11x11 tiles\r\n\/\/ 7 = Starting point\r\n\/\/ 8 = Ending point\r\n\/\/ 0 = Wall\r\n\/\/ 6 = Path\r\n\r\n0,0,0,0,0,0,0,0,0,0,0,\r\n0,7,0,0,0,0,0,0,0,0,0,\r\n0,6,0,6,6,6,6,6,6,6,0,\r\n0,6,0,0,0,0,0,0,0,6,0,\r\n0,6,6,6,0,6,6,6,6,6,0,\r\n0,0,0,6,0,6,0,0,0,6,0,\r\n0,6,0,6,0,6,0,6,0,6,0,\r\n0,6,0,6,0,6,0,6,0,6,0,\r\n0,6,6,6,6,6,0,6,6,6,0,\r\n0,0,0,6,0,0,0,0,0,8,0,\r\n0,0,0,0,0,0,0,0,0,0,0,\r\n<\/pre>\n
    And another thing is path finding, the first choice is of course A*<\/a>, but I removed\/modified several things;<\/p>\n
      \n
    1. The past path-cost function<\/em>, as is not required<\/li>\n
    2. The open and close list, since I thought duplicating the scene<\/em> array and tagging it with a different number would be faster, there’s no need for additional iterations nor added processing to deconstruct the extra arrays.<\/li>\n
    3. And as for the future path-cost function<\/em> I employed the Manhattan Method, which goes something like this.<\/li>\n<\/ol>\n
      H = 10*(abs(currentX-targetX) + abs(currentY-targetY))[\/cc]\r\n\r\nSimple enough, note the coefficient 10 is not necessary unless you're dealing with decimal, I used it just for the sake of it \u51f8(\uff400\u00b4)\u51f8\r\n\r\n\r\nvoid MazeGenerator::addPathfinding() {\r\n    \r\n    \/\/ Duplicate the stage\r\n    _pfind = CCArray::create();\r\n    _pfind->addObjectsFromArray(_stage);\r\n    \r\n    CCArray* stack = CCArray::create();\r\n    CCArray* r;\r\n    CCInteger* p;\r\n    \r\n    int s = _start, pos = 0;\r\n    \r\n    while (_path > 0) {\r\n        \r\n        \/\/ Check surrounding for Path\r\n        r = checkSurrounding(_pfind, s, PATH);\r\n        \r\n        \/\/ If path exists\r\n        if (r->count() > 0) {\r\n            \r\n            int temp = 0;\r\n            \r\n            for (int i = 0; i < r->count(); i++) {\r\n                \r\n                p = dynamic_cast<CCInteger *>(r->objectAtIndex(i));\r\n                \r\n                temp = getCost(p->getValue());\r\n                \r\n                \/\/ to filter smallest cost\r\n                if(temp < pos) pos = temp;\r\n                \r\n            }\r\n            \r\n            \/\/ Mark the path with 1\r\n            _pfind->replaceObjectAtIndex(pos, CCInteger::create( 1 ));\r\n            stack->addObject(CCInteger::create( pos ));\r\n            \r\n            \/\/ break if end reached\r\n            CC_BREAK_IF(_end == pos);\r\n            \r\n            _path--;\r\n            \r\n        } else {\r\n            \r\n            if cul-de-sac, step back\r\n            stack->removeLastObject();\r\n            p = dynamic_cast<CCInteger *>( stack->lastObject());\r\n            \r\n            s = p->getValue();\r\n        }\r\n \r\n    }\r\n    \r\n}\r\n\r\n\/**\r\n\r\nThe Manhattan Method\r\n\r\n*\/\r\nint MazeGenerator::getCost(int p) {\r\n    \r\n    int x0 = _end%_w,\r\n        y0 = _end\/_w,\r\n        x1 = p%_w,\r\n        y1 = p\/_w;\r\n    \r\n    return 10*(abs(x1-x0)+abs(y1-y0));\r\n    \r\n}\r\n<\/pre>\n
      And the results is pretty good.<\/p>\n
      \r\n\r\n\/\/ 1 = Routes\r\n\r\n0,0,0,0,0,0,0,0,0,0,0,\r\n0,7,0,0,0,0,0,0,0,0,0,\r\n0,1,0,6,6,6,6,6,6,6,0,\r\n0,1,0,0,0,0,0,0,0,6,0,\r\n0,1,1,1,0,1,1,1,1,1,0,\r\n0,0,0,1,0,1,0,0,0,1,0,\r\n0,6,0,1,0,1,0,6,0,1,0,\r\n0,6,0,1,0,1,0,6,0,1,0,\r\n0,6,6,1,1,1,0,6,6,1,0,\r\n0,0,0,1,0,0,0,0,0,1,0,\r\n0,0,0,0,0,0,0,0,0,0,0,\r\n<\/pre>\n
      Until next time.<\/p>\n","protected":false},"excerpt":{"rendered":"
      Starting on my own game, although brilliant idea is immensely dependent on how the stars are aligned (metaphorical speaking obviously) still I can’t disclose the exact concept since the indie game scenery is notoriously brutal, but in a glimpse the basic premise is a maze with a few added twists. \u3058\u3083\u3042\u3001\u3044\u304d\u307e\u3057\u3087\u3046\u30fc\uff01 Choosing the Framework There […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[2,7,16,18,19,23,24,33,34,41],"tags":[119],"_links":{"self":[{"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=\/wp\/v2\/posts\/1047"}],"collection":[{"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1047"}],"version-history":[{"count":1,"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=\/wp\/v2\/posts\/1047\/revisions"}],"predecessor-version":[{"id":1635,"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=\/wp\/v2\/posts\/1047\/revisions\/1635"}],"wp:attachment":[{"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1047"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1047"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/rahmat-hidayat.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1047"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}