Quantum Computing

[Werewolf]

I wonder if quantum could do a pure brute force search with no mini-max?

Mini-Max is the brute force method for computing chess, the whole game tree to the end, with win/draw/loss.

Thus the question would be, how to implement Mini-Max on Quantum Computers based on quantum gates, qubits?

My own estimation says you will need qubits in the range of thousands to implement Mini-Max for TicTacToe, and in the range of billions for the game of Chess.

There are also qudits, which can store decimals, theoretical there are also quinfs, to compute with infinity, a hyper-turing-machine, as mentioned, in theory.

There is also another approach, the von Neumann architecture for quantum computers, to separate memory and computation.

ATM I see no practical value of quantum computers for chess, it is more likely that we will use qubits for inferring neural networks first.

--
Srdja

Sorry Xmas eve jubilations. I meant no alpha beta.