Primality-testing Mersenne Numbers (II)

Reports the factor-filtering and primality-testing of Mersenne Numbers Mp for p < 100000, the latter using the ICL 'DAP' Distributed Array Processor.

The CAFS system today and tomorrow

The CAFS search engine is a real machine in a virtual machine world; it is the hardware component of ICL's CAFS system. The paper is an introduction and prelude to the set of papers in this volume on CAFS applications. It defines The CAFS system and its context together with the function of its hardware and software components. It examines CAFS' role in the broad context of application development and information systems; it highlights some techniques and applications which exploit the CAFS system. Finally, it concludes with some suggestions for possible further developments. 'Search out thy wit for secret policies And we will make thee famous through the world' Henry VI, 1:3

Reference fallible endgame play

A reference model of fallible endgame play is defined in terms of a spectrum of endgame players whose play ranges in competence from random to optimal choice of move. They may be used as suitable practice partners, to differentiate between otherwise equi-optimal moves, to promote or expedite a result, to assess an opponent, to run Monte Carlo simulations, and to identify the difficulty of a position or a whole endgame.

3-5-man chess: Maximals and mzugs

This article reports the combined results of several initiatives in creating and surveying complete suites of endgame tables (EGTs) to the Depth to Mate (DTM) and Depth to Conversion (DTC) metrics. Data on percentage results, maximals and mutual zugzwangs, mzugs, has been filed and made available on the web, as have the DTM EGTs.

Exploiting CAFS-ISP

In the summer of 1982, the ICLCUA CAFS Special Interest Group defined three subject areas for working party activity. These were: 1) interfaces with compilers and databases, 2) end-user language facilities and display methods, and 3) text-handling and office automation. The CAFS SIG convened one working party to address the first subject with the following terms of reference: 1) review facilities and map requirements onto them, 2) "Database or CAFS" or "Database on CAFS", 3) training needs for users to bridge to new techniques, and 4) repair specifications to cover gaps in software. The working party interpreted the topic broadly as the data processing professional's, rather than the end-user's, view of and relationship with CAFS. This report is the result of the working party's activities. The report content for good reasons exceeds the terms of reference in their strictest sense. For example, we examine QUERYMASTER, which is deemed to be an end-user tool by ICL, from both the DP and end-user perspectives. First, this is the only interface to CAFS in the current SV201. Secondly, it is necessary for the DP department to understand the end-user's interface to CAFS. Thirdly, the other subjects have not yet been addressed by other active working parties.

CAFS in action

For those few readers who do not know, CAFS is a system developed by ICL to search through data at speeds of several million characters per second. Its full name is Content Addressable File Store Information Search Processor, CAFS-ISP or CAFS for short. It is an intelligent hardware-based searching engine, currently available with both ICL's 2966 family of computers and the recently announced Series 39, operating within the VME environment. It uses content addressing techniques to perform fast searches of data or text stored on discs: almost all fields are equally accessible as search keys. Software in the mainframe generates a search task; the CAFS hardware performs the search, and returns the hit records to the mainframe. Because special hardware is used, the searching process is very much more efficient than searching performed by any software method. Various software interfaces are available which allow CAFS to be used in many different situations. CAFS can be used with existing systems without significant change. It can be used to make online enquiries of mainframe files or databases or directly from user written high level language programs. These interfaces are outlined in the body of the report.

Depth by The Rule

This note corrects a previous treatment of algorithms for the metric DTR, Depth by the Rule.

Discarding Like Pieces

The guideline of ‘discarding like men’ to estimate the merit of a chess position is well known. This note compares it with some statistics.

Chess endgame news

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.

Chess endgame news

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.

Chess endgame news

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.

Endgame table testing of studies - 1

The van der Heijden Studies Database has been reviewed to identify 'Draw Studies' with sub-7-man positions in the main line which are not draws. The data-mining method is described. Some 1,500 studies were faulted, 700 for the first time: 14 of the more interesting faults are highlighted and discussed.

Chess endgame update

This is a review of progress in the Chess Endgame field. It includes news of the promulgation of Endgame Tables, their use, non-use and potential runtime creation. It includes news of data-mining achievements related to 7-man chess and to the field of Chess Studies. It includes news of an algorithm to create Endgame Tables for variants of the normal game of chess.

Endgame table testing of studies - II

The van der Heijden Studies Database (Version III) has been reviewed to identify 'Win Studies' with sub-7-man positions in the main line which are not wins for White. Some studies were faulted, A number for the first time: 21 of the more interesting escapes by Black are highlighted, themed and discussed.