Question

请高人帮忙翻译一段自动化专业英语课文

To use the BACKTRACK procedure to solve the 4-queens problem,we have still to specify both the predicate DEADEND and an ordering relation for applicable rules.Suppose we arbitrarily say that Rij is ahead of Rik in the ordering only when j<k.The predicate DEADEND might be defined so that it is satisfied for databases where it is obvious that no solution is possible;for example,certainly no solution is possible for any database containing a pair of queen marks in mutually capturing positions.Altogether,the algorithm backtracks 22 times before finding a solution;even the very first rule applied must ultimately be taken back.
A more efficient algorithm(with less backtracking) can be obtained if we use a more informed rule ordering.One simple,but useful ordering for this problem involves using the function diag(i,j),defined to be the length of the longest diagonal passing through cell(i,j).Let Rij be ahead of Rmn in the ordering if diag(i,j)<diag(m,n).(For equal values of diag,use the same order as before.)Using this ordering relation,the rules that are applicable to the initial database would be ordered as follow:(R12,R13,R11,R14).The reader might verify that this ordering scheme solves the 4 queens problem with only 2 backtracks.
字数太短，下面图片里还有一段，急用，在线等，回答的快追加50！谢谢各位了

Answer 1

要使用BackTrack是程序解决4皇后问题，我们还有同时指定谓词死路和适用的次序关系rules.Suppose我们随便说，里杰是在提前订货里克只有当j <k.The predicate DEADEND might be defined so that it is satisfied for databases where it is obvious that no solution is possible;for example,
当然是没有解决任何数据库可能包含相互捕捉positions.Altogether标志的女王对，回溯算法22次才能找到解决办法，甚至第一的规则适用于最终必须收回。
一种更有效的算法（回溯少），可如果我们使用一个更明智的规则ordering.One简单，但对于这个问题很有用命令包括使用功能诊断（1，j）条，定义为最长的对角线长度通过细胞传递（1，j）条。让里杰不停量度提前在订货，如果诊断（一，十） <diag(m,n).(For equal values of diag,
使用相同的命令之前。）使用此命令的关系，规则，适用于初始数据库将被命令如下：（R12的，R13类型，r11，一款R14）。读者可能会验证此订购计划，解决了4皇后问题只有2退步。

Answer 2

才50。。。
现在知道英文有用了吧？

Answer 3

用灵格斯词霸 对照着翻译

专业文章不懂这方面的人翻译不对的

自动翻译纯属笑话~~

我们电子专业的文章也这样 只能自己对照着词典 根据自己的理解来翻译的

时间也花不了多少~~