Note: Variations that are in the notation at the start of the analysis are never deleted and are always analysed, unless they are the results of a previous Cloud Analysis. Skip Iteration: This skips an analysis level, which increases the processor time and the analysis depth of the engine. If individual cloud engines stop running the analysis continues, as long as at least one local engine is running. These engines automatically adopt the correct roles. The candidate engine runs in multi-variation mode, because it has to calculate a lot of candidate moves.ĭuring the deep analysis other engines can be added to the cloud server without interrupting the analysis. The title bar of the engine window tells us what function the engine has. In the example this is done by the Houdini engine. The additional cloud engines calculate answers to the moves simultaneously, which are then added without losing any time. One engine makes the candidate moves and creates a variation tree. The function then accesses engines that are running in parallel.
Open Cloud Engines: You can add cloud engines to the analysis to improve the quality. The result can be stored as a different game, or the existing notation can be overwritten. If a variation cannot be proved to be good at two consecutive depths it disappears from the notation, so that only the best continuations are analysed and displayed.ĭuring the analysis there are two ways you can influence the analysis: In the notation variations are shown in grey if they do not seem good at the current depth. Every iteration increases the processor time. This generates a tree which changes from iteration to iteration. The program analyses candidate moves and makes the moves for further analysis, as every chess player would do it himself. The tree is dynamically updated and weaker variations are removed. After the function has been started the program calculates indefinitely and generates an analysis tree with the best moves and replies. This function is an improvement over Fritz's deep position analysis, because no time is specified and the variation tree is dynamically restructured as the search progresses.
This leads to an annotation with an analysis of the most important moves. Variations that do not look good after a large search depth are automatically removed. After longer times the search depth is bigger, but not too complex so that the result remains easy to understand. The longer it runs, the more reliable the variations are. In the deep analysis the engine generates a tree with the possible moves. For this it is necessary to let an engine examine a position for a long time. This is very good for preliminary analysis so that you can get used to the motives of the position, but sometimes engines need more time to examine a position in detail. They try out variations on the board and let them be evaluated by chess engines. Most chess players analyse their games interactively.
0 kommentar(er)
