本文整理汇总了TypeScript中ceval.winningChances类的典型用法代码示例。如果您正苦于以下问题：TypeScript winningChances类的具体用法？TypeScript winningChances怎么用？TypeScript winningChances使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
在下文中一共展示了winningChances类的6个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的TypeScript代码示例。
示例1: makeComment
function makeComment(prev: Tree.Node, node: Tree.Node, path: Tree.Path): Comment {
let verdict, best;
const over = root.gameOver(node);
if (over === 'checkmate') verdict = 'goodMove';
else {
const nodeEval: Eval = tbhitToEval(node.tbhit) || (
(node.threefold || over === 'draw') ? { cp: 0 } : node.ceval as Eval
);
const prevEval: Eval = tbhitToEval(prev.tbhit) || prev.ceval!;
const shift = -winningChances.povDiff(root.bottomColor(), nodeEval, prevEval);
best = nodeBestUci(prev)!;
if (best === node.uci || best === altCastles[node.uci!]) best = null;
if (!best) verdict = 'goodMove';
else if (shift < 0.025) verdict = 'goodMove';
else if (shift < 0.06) verdict = 'inaccuracy';
else if (shift < 0.14) verdict = 'mistake';
else verdict = 'blunder';
}
return {
prev,
node,
path,
verdict,
best: best ? {
uci: best,
san: pv2san(variant, prev.fen, false, [best])
} : undefined
};
}示例2: makeComment
function makeComment(prev, node: Tree.Node, path: Tree.Path): Comment {
let verdict, best;
const over = root.gameOver(node);
if (over === 'checkmate') verdict = 'good';
else {
const nodeEval: Eval = (node.threefold || over === 'draw') ? {
cp: 0
} : (node.ceval as Eval);
const shift = -winningChances.povDiff(root.bottomColor(), nodeEval, prev.ceval);
best = prev.ceval.pvs[0].moves[0];
if (best === node.uci || best === altCastles[node.uci]) best = null;
if (!best) verdict = 'good';
else if (shift < 0.025) verdict = 'good';
else if (shift < 0.06) verdict = 'inaccuracy';
else if (shift < 0.14) verdict = 'mistake';
else verdict = 'blunder';
}
return {
prev,
node,
path,
verdict,
best: best ? {
uci: best,
san: pv2san(root.data.game.variant.key, prev.fen, false, [best])
} : undefined
};
}示例3:
n.threat.pvs.slice(1).forEach(function(pv) {
const shift = winningChances.povDiff(opposite(color as Color), pv, n.threat!.pvs[0]);
if (shift > 0.2 || isNaN(shift) || shift < 0) return;
shapes = shapes.concat(makeAutoShapesFromUci(pv.moves[0], 'paleRed', {
lineWidth: Math.round(11 - shift * 45) // 11 to 2
}));
});示例4:
pv1s.forEach(function(pv) {
const shift = winningChances.povDiff(rcolor, pv, pv0);
if (shift >= 0 && shift < 0.2) {
shapes = shapes.concat(makeShapesFromUci(rcolor, pv.moves[0], 'paleRed', {
lineWidth: Math.round(11 - shift * 45) // 11 to 2
}));
}
});示例5: checkCeval
function checkCeval(): void {
var node = root.node,
cur = current();
if (!cur || feedback() !== 'eval' || cur.fault.node.ply !== node.ply) return;
if (isCevalReady(node)) {
var diff = winningChances.povDiff(color, node.ceval!, cur.prev.node.eval);
if (diff > -0.035) onWin();
else onFail();
}
}示例6: evalSwings
export function evalSwings(mainline: Tree.Node[], nodeFilter: (node: Tree.Node) => boolean): Tree.Node[] {
const found: Tree.Node[] = [];
const threshold = 0.075;
for (var i = 1; i < mainline.length; i++) {
var node = mainline[i];
var prev = mainline[i - 1];
if (nodeFilter(node) && node.eval && prev.eval) {
var diff = Math.abs(winningChances.povDiff('white', prev.eval, node.eval));
if (diff > threshold && hasCompChild(prev)) found.push(node);
}
}
return found;
}