Eta Chess

Eta Project Paused

Eta chess engine project paused.

I think a parallel BestFirstMiniMax-Search with NNUE eval is worth to give a try. It would be nice to compare parallel BestFirstMiniMax with MCTS-UCT, MCTS-PUCT, MCTS-AB, MCTS-Rollouts and take a look into DAG (directed acyclic graph) but I currently lack the time to work in this. There are other chess engines out there, which combine a Best-First search (MCTS-derivative) with NNUE eval.

Yet Another Turing Test

Now with context generative AIs, the switch from pattern recognition to pattern creation with neural networks, I would like to propose my own kind of Turing Test:

An AI which is able to code a chess engine and outperforms humans in this task.

1A) With hand-crafted eval. 1B) With neural networks.

2A) Outperforms non-programmers. 2B) Outperforms average chess-programmers. 2C) Outperforms top chess-programmers.

3A) An un-self-aware AI, the "RI", restricted intelligence. 2B) A self-aware AI, the "SI", sentient intelligence.

***update 2024-02-14***

4A) An AI based on expert-systems. 4B) An AI based on neural networks. 4C) A merger of both.

The Chinese Room Argument applied onto this test would claim that there is no conscious in need to perform such a task, hence this test is not meant to measure self-awareness, consciousness or sentience, but what we call human intelligence.

The first test candidate was already posted by Thomas Zipproth, Dec 08, 2022:

Provide me with a minimal working source code of a chess engine

Home - Top