1 　　-4.500158825082766
2 　　3.4181268101392694
3 　　-3.2178882868487753
4 　　-9.348695305445199
5 　　-7.899265427351652
6 　　-3.3855972247263626

/** @brief    走法生成器*/
function MoveGenerator() {
}MoveGenerator.prototype.generate = function(tetrisUnit, shape) {var keymapFunc = function(x, y, idx) {return "" + x + ":" + y + ":" + idx;}var moveMapFunc = function(step) {return {x:step.x, y:step.y, idx:step.idx};}var results = [];var boards = tetrisUnit.boards;var rownum = tetrisUnit.row;var colnum = tetrisUnit.col;var shapeArrs = shape.shapes;var occupy = {}var actionQueues = [];actionQueues.push({x:shape.x, y:shape.y, idx:shape.idx, prev:-1});occupy[keymapFunc(shape.x, shape.y, shape.idx)] = true;var head = 0;while ( head < actionQueues.length )  {var step = actionQueues[head];// 1). 向左移动一步var tx = step.x - 1;var ty = step.y;var tidx = step.idx;if ( tetrisUnit.checkAvailable(tx, ty, shapeArrs[tidx]) ) {var key = keymapFunc(tx, ty, tidx);if ( !occupy.hasOwnProperty(key) ) {actionQueues.push({x:tx, y:ty, idx:tidx, prev:head});occupy[key] = true;}}// 2). 向右移动一步tx = step.x + 1;ty = step.y;tidx = step.idx;if ( tetrisUnit.checkAvailable(tx, ty, shapeArrs[tidx]) ) {var key = keymapFunc(tx, ty, tidx);if ( !occupy.hasOwnProperty(key) ) {actionQueues.push({x:tx, y:ty, idx:tidx, prev:head});occupy[key] = true;}}// 3). 旋转一步tx = step.x;ty = step.y;tidx = (step.idx + 1) % 4;if ( tetrisUnit.checkAvailable(tx, ty, shapeArrs[tidx]) ) {var key = keymapFunc(tx, ty, tidx);if ( !occupy.hasOwnProperty(key) ) {actionQueues.push({x:tx, y:ty, idx:tidx, prev:head});occupy[key] = true;}}// 4). 向下移动一步tx = step.x;ty = step.y + 1;tidx = step.idx;if ( tetrisUnit.checkAvailable(tx, ty, shapeArrs[tidx]) ) {var key = keymapFunc(tx, ty, tidx);if ( !occupy.hasOwnProperty(key) ) {actionQueues.push({x:tx, y:ty, idx:tidx, prev:head});occupy[key] = true;}} else {// *) 若不能向下了, 则为方块的一个终结节点.var tmpMoves = [];tmpMoves.push(moveMapFunc(step));var tprev = step.prev;while ( tprev != -1 ) {tmpMoves.push(moveMapFunc(actionQueues[tprev]));tprev = actionQueues[tprev].prev;}tmpMoves.reverse();results.push({last:step, moves:tmpMoves});}head++;}return results;}

function Evaluator() {
}Evaluator.prototype.evaluate = function(boards) {
}function PierreDellacherieEvaluator() {
}PierreDellacherieEvaluator.prototype = new Evaluator();
PierreDellacherieEvaluator.prototype.constructor = PierreDellacherieEvaluator;PierreDellacherieEvaluator.prototype.evaluate = function(boards, shape) {return (-4.500158825082766) * landingHeight(boards, shape)          // 下落高度+ (3.4181268101392694) * rowsEliminated(boards, shape)      // 消行个数+ (-3.2178882868487753) * rowTransitions(boards)            // 行变换+ (-9.348695305445199) * colTransitions(boards)             // 列变化+ (-7.899265427351652) * emptyHoles(boards)                 // 空洞个数+ (-3.3855972247263626) * wellNums(boards);                 // 井数
}

function AIStrategy() {this.generator = new MoveGenerator();this.evalutor = new PierreDellacherieEvaluator();
}/** @brief 作出最优的策略* @return  {dest:{x:{x}, y:{y}, idx:{idx}}, [{action_list}]}*/AIStrategy.prototype.makeBestDecision = function(tetrisUnit, shape) {var bestMove = null;var bestScore = -1000000;// 1) 生成所有可行的落点, 以及对应的路径线路var allMoves = this.generator.generate(tetrisUnit, shape);// 2) 遍历每个可行的落点, 选取最优的局面落点for ( var i = 0; i < allMoves.length; i++ ) {var step = allMoves[i].last;var shapeArrs = shape.shapes;var bkBoards = tetrisUnit.applyAction2Data(step.x, step.y, shapeArrs[step.idx]);// 2.1) 对每个潜在局面进行评估var tscore = this.evalutor.evaluate(bkBoards, {x:step.x, y:step.y, shapeArr:shapeArrs[step.idx]});// 2.2) 选取更新最好的落点和路径线路if ( bestMove === null || tscore > bestScore ) {bestScore = tscore;bestMove = allMoves[i].moves;}}// 3) 返回最优可行落点, 及其路径线路return {score:bestScore, action_moves:bestMove};}