959 resultados para international news
Resumo:
The R-package “compositions”is a tool for advanced compositional analysis. Its basic functionality has seen some conceptual improvement, containing now some facilities to work with and represent ilr bases built from balances, and an elaborated subsys- tem for dealing with several kinds of irregular data: (rounded or structural) zeroes, incomplete observations and outliers. The general approach to these irregularities is based on subcompositions: for an irregular datum, one can distinguish a “regular” sub- composition (where all parts are actually observed and the datum behaves typically) and a “problematic” subcomposition (with those unobserved, zero or rounded parts, or else where the datum shows an erratic or atypical behaviour). Systematic classification schemes are proposed for both outliers and missing values (including zeros) focusing on the nature of irregularities in the datum subcomposition(s). To compute statistics with values missing at random and structural zeros, a projection approach is implemented: a given datum contributes to the estimation of the desired parameters only on the subcompositon where it was observed. For data sets with values below the detection limit, two different approaches are provided: the well-known imputation technique, and also the projection approach. To compute statistics in the presence of outliers, robust statistics are adapted to the characteristics of compositional data, based on the minimum covariance determinant approach. The outlier classification is based on four different models of outlier occur- rence and Monte-Carlo-based tests for their characterization. Furthermore the package provides special plots helping to understand the nature of outliers in the dataset. Keywords: coda-dendrogram, lost values, MAR, missing data, MCD estimator, robustness, rounded zeros
Resumo:
The Endgame Tables Online initiative and p2p community have made available all published Nalimov DTM EGTs. It now looks forward to the 16 unpublished EGTs computed by August 9th and presumed to be still in existence, particularly as Marc Bourzutschky’s FEG results independently confirm all Nalimov’s published 3-3p DTM EGT statistics including those for KPPKPP.
Resumo:
A report of the new Bourzutschky/Konoval chess endgame depth record of DTC = 330 moves, and of the progress of the Kryukov peer-group to disseminate Nalimov's DTM EGTs. The question of data integrity and assurance is raised.
Resumo:
News that Bourzutschky confirms there is no sub-7-man pawnless zugzwang, and that Bourzutschky and Konoval are generating DTC EGTs with a new program. News also of Kristensen's work on EGTs using OBDDs, Ordered Binary Decision Diagrams.
Resumo:
Reports the availability on the web of the entire run of Beasley's 'British Endgame Study News', and reviews a recent report by Bourzutschky and Konoval on their discoveries with 7-man endgame tables.
Resumo:
This article reviews the KQPKQP endgame of the ROOKIE-BARON game of the World Computer Chess Championship, 2011. It also reviews the decisive KRNPKBP endgame in the second Anand-Gelfand rapid game of the World Chess Championship 2012. There is a review of parts 2-3 of the Bourzutschky-Konoval 7-man endgame series in EG, of the new endgame software tool FinalGen, and of the 'Lomonosov' endgame table generation programme in Moscow.
Resumo:
This review starts with a demonstration of the power of FinalGen and the new Lomonosov 7-man endgame tables, each giving an alternative 'bionic' ending to the 'five Queens' Hao-Carlsen (Tata Chess 2013) game. The completion of the Lomonosov 7-man DTM EGTs is announced. The final two parts of the Bourzutschky-Konoval 7-man-chess series in EG are summarised.
Resumo:
Three topics are discussed. First, an issue in the epistemology of computer simulation - that of the chess endgame 'becoming' what computer-generated data says it is. Secondly, the endgames of the longest known games are discussed, and the concept of a Bionic Game is defined. Lastly, the set of record-depth positions published by Bourzutschky and Konoval are evaluated by the new MVL tables in Moscow - alongside the deepest known mate of 549 moves.
Resumo:
This note defines what it means by the 'chess endgame' and looks at the frequency of sub-n-man and 'FinalGen' positions in games and studies and in the FIDE 2013 World Cup. It includes the exposition of the DTM-minimaxing line from one of the three DTM-deepest known (KQPKRBN) positions. It refines the definitions of 'longest game' and 'bionic game'. The games of the FIDE 2013 World Cup and the longest known decisive game are available here.
Resumo:
This note includes some endgame reflections on the last World Chess Championship, an update on the search for the longest decisive games between computers, and a brief mention of the sets of endgame table (EGT) statistics recently received from Yakov Konoval (2013) and from Victor Zakharov (2013) for the Lomonosov team.
Resumo:
This paper notes FIDE's 75-move rule (9.6b) and suggests some implications. It reviews two endgame-table initiatives associated with the 50-move rule. One is Huntington's mainly sub-6-man multi-valued DTM50 EGTs implemented in HASKELL. The other is Ronald de Man's WDL' and DTZ50' EGTs which introduce a 5-way evaluation of positions, and ascribe a depth to decisive positions which are not 50-move-rule wins or losses. There is also some first detail about the Lomonosov '7-man DTM EGT' team, and comments on reactions to 'Haworth's Law'.
Resumo:
The DTZ metric indicates the minimaxed 'Depth To Zeroing of the ply-count' for decisive positions. Ronald de Man's DTZ50' metric is a variant of the DTZ metric as moderated by the FIDE 50-move draw-claim rule. DTZ50'-depths are given to '50-move-rule draws' as well as to unconditionally decisive positions. This note defines a two-dimensional taxonomy of positions implicitly defined by DTZ50'. 'Decisive' positions may have values of (wins/losses) v =1/-1 or v = 2/-2. A position's depth in the new DTZ50' metric may be greater than, equal to or less than its DTZ depth. The six parts of the taxonomy are examined in detail, and illustrated by some 40 positions and 16 lines. Positions, lines and the annotation of these lines are supplied in the ancillary data files.
Resumo:
This note investigates the recently revived proposal that the stalemated side should lose, and comments further on the information provided by the FRITZ14 interface to Ronald de Man’s DTZ50' EGTs. The history of stalemate is convoluted, and there is an argument for computing chess endgame tables to revised rules to examine the impact of any change. The FRITZ14 interface to the DTZ50' EGTs exhibits residual 'one-out' and end-of-phase errors. Example positions are provided to illustrate the stalemate and the DTZ50' issues described.
Resumo:
Newborn and Hyatt recently tested the chess-engine CRAFTY on two test sets of 16 positions each. The performance of an engine making greater use of endgame tables (EGTs) is compared with that of CRAFTY. Reference is made to three other articles in which composed positions have been used to test a variety of chess engines. Supporting data here comprises two pgn files, an annotated-pgn file and the original data worksheets used.
