Although considered to be infallible, HAL makes an error. However, the imaginations of artists and scientists are a treasure trove of material that tells the story of superintelligence freed from any human control.Īboard the spaceship Discovery One, only the supercomputer HAL 9000 has been informed by its creators of the purpose of the mission: to reach Jupiter and search for signs of extra-terrestrial intelligence. To date, we have no experience of accidents or disasters due to faulty or malicious AI.
These two events propel us into a debate over the risks created by the development of superintelligence that could eliminate jobs on a massive scale or, even worse, wipe the human species off the face of the planet – and raise the question of how to assess such a threat. In an intriguing scheduling coincidence, IBM, Kubrick’s partner during the filming of A Space Odyssey, and Airbus have just unveiled the CIMON (Crew Interactive Mobile Companion) project, an “intelligent, mobile and interactive astronaut assistance system” that will join the International Space Station. Wheeler, Chess.Almost everyone knows the story of HAL 9000, the killer supercomputer in Stanley Kubrick’s landmark film 2001: A Space Odyssey, whose 50th anniversary will be celebrated on at the 71st Cannes Film Festival.
Frank Poole v HAL 9000 - or is it CM9000? by John Merlino, CCC, July 10, 2002 » Chessmaster.Off-topic: HAL by Dave Gomboc, CCC, July 19, 2000.Selectivity is due to check extensions and depth limited quiescence search.Įvaluation considers material balance, a material exchange heuristic, and positional heuristic terms for development, king attack, defence, threats, mobility, advancement, captures and checks. Move ordering is improved by the refutation table based on the triangular PV-table, and a sophisticated killer heuristic with up to four killers per ply. The search algorithm is pure alpha-beta implemented as recursive negamax with fail-soft bounds inside the iterative deepening framework with aspiration windows. HAL's board is represented by an incremental updated 8x8 board, a two-dimensional array of board cells, and a piece-list as array of piece cells indexed by side (1.2) and man index 1.16. HAL utilizes the long algebraic notation. The directives are given to HAL in the form of English sentences, which can be rather free-form in structure, and will even allow for slight misspellings in certain situations. HAL has a command line interface, and supports an interactive English dialogue between the opponent and itself to receive and report its moves and to receive directives, such as skill level. (* KILLER HEURISTIC AND REFUTATION TABLES.
(* FAILSOFT ALPHA-BETA SEARCH ALGORITHM WITH QUIESCENCE, THE *) (* THIS PROGRAM UTILIZES THE ITERATIVE-DEEPENING NEGAMAX *) (* C O M P U T E R C H E S S A U T O M A T O N *) (* This corrected the missed checkmate declaration when playing *) (* and stored it in an LX variable when level of play was < 3. (* 2) In EVAL Procedure decremented level variable at P^.LX by 1 *) (* re-searches for failed-low and failed-high when Level is < 3.*) (* 1) In Move_Selector Procedure set -INF and +INF for *) (* Heuristic Associative Linear-algorithm *)