象棋游戏决策树结构 [英] chess game decision tree structure

问题描述

大家好，

我正在用c＃语言设计国际象棋游戏，现在我想为计算机播放器实现AI，它基本上可以在决策树上找到。但问题是如下，有没有一种方法来构建这个树而不使用数据库（访问或SQL），如果有如何？



提前谢谢。

Hello everyone,
I am designing a chess game in c# language, now i want to implement the AI for the computer player, it is basically found on decision tree. but the problem is as follow, Is there a method of constructing this tree without using database (access or sql) and if there is How to?

Thanks in advance.

推荐答案

应用于整个游戏的简单决策树方法在实践中绝对不适用于国际象棋。这个事实的解释是学校最喜欢的寓言之一，通常是针对小学和中学之间的学生。



这是提示：尝试估计数字节点。



如果您的意思不同，例如将这个想法应用于某些特殊情况，请解释。

-SA

A straightforward decision tree approach applied to a whole game is absolutely not applicable to chess in practice. Explanation of this fact is one of the favorite fables for school, usually addressed to students somewhere between elementary and middle school.

Here is the hint: try to estimate the number of nodes.

If you mean something different, such as application of this idea to some special cases, please explain.

—SA

这篇关于象棋游戏决策树结构的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！