public void reset_stat(bool[,] field, bool b2b, int combo)
{
Board.field = field;
Board.column_height = Board.updatecol();
Board.isb2b = b2b;
Board.combo = combo;
boardtree = new tree();
boardtree.Board = Board.clone();
extend_node();
}
public void reset_stat(board a)
{
Board = a.tosimple();
tree temp = boardtree.clone();
temp.pieceidx = boardtree.pieceidx;
boardtree = temp;
boardtree.Board = Board.clone();
extend_node();
}
public void init()
{
boardtree = new tree();
board F = new board(new mino_gene(), new TopGarbage(), 5);
boardtree.Board = Board.clone();
//for (int i = 0; i < 15; ++i) F.add_garbage(1);
//boardtree.Board = F.tosimple();
//boardtree.ad
//nodequeue.Add(boardtree);
}
//public bool findnextsol()
//{
// for (; ; )
// yield return false; // pass
//}
public tree clone()
{
tree cp = new tree();
cp.Board = Board.clone();
cp.garbage = garbage; // 可能有抵消
cp.attack = attack;
cp.holdpiece = holdpiece;
cp.battlescore = battlescore;
// attack 可能继承
return(cp);
}
public void reset_stat(bool[,] field, bool b2b, int combo)
{
tree temp = boardtree.clone();
temp.pieceidx = boardtree.pieceidx;
Board = temp.Board.clone();
Board.field = field;
Board.column_height = Board.updatecol();
Board.isb2b = b2b;
Board.combo = combo;
boardtree = temp;
boardtree.Board = Board.clone();
extend_node();
}
