Understanding human intelligence through human limitations

TL Griffiths - Trends in Cognitive Sciences, 2020 - cell.com
Recent progress in artificial intelligence provides the opportunity to ask the question of what
is unique about human intelligence, but with a new comparison class. I argue that we can …

Solving the Rubik's cube with deep reinforcement learning and search

F Agostinelli, S McAleer, A Shmakov… - Nature Machine …, 2019 - nature.com
The Rubik's cube is a prototypical combinatorial puzzle that has a large state space with a
single goal state. The goal state is unlikely to be accessed using sequences of randomly …

[图书][B] Why information grows: The evolution of order, from atoms to economies

C Hidalgo - 2015 - books.google.com
" Hidalgo has made a bold attempt to synthesize a large body of cutting-edge work into a
readable, slender volume. This is the future of growth theory."--Financial Times What is …

Topological quantum compiling with reinforcement learning

YH Zhang, PL Zheng, Y Zhang, DL Deng - Physical Review Letters, 2020 - APS
Quantum compiling, a process that decomposes the quantum algorithm into a series of
hardware-compatible commands or elementary gates, is of fundamental importance for …

Overview of Rubik's cube and reflections on its application in mechanism

DX Zeng, M Li, JJ Wang, YL Hou, WJ Lu… - Chinese Journal of …, 2018 - Springer
Rubik's Cube is a widely popular mechanical puzzle that has attracted attention around the
world because of its unique characteristics. As a classic brain-training toy well known to the …

Mapping graph state orbits under local complementation

JC Adcock, S Morley-Short, A Dahlberg… - Quantum, 2020 - quantum-journal.org
Graph states, and the entanglement they posses, are central to modern quantum computing
and communications architectures. Local complementation–the graph operation that links all …

Bidirectional search that is guaranteed to meet in the middle

R Holte, A Felner, G Sharon, N Sturtevant - Proceedings of the AAAI …, 2016 - ojs.aaai.org
We present MM, the first bidirectional heuristic search algorithm whose forward and
backward searches are guaranteed to''meet in the middle'', ie never expand a node beyond …

Solving the Rubik's cube without human knowledge

S McAleer, F Agostinelli, A Shmakov, P Baldi - arXiv preprint arXiv …, 2018 - arxiv.org
A generally intelligent agent must be able to teach itself how to solve problems in complex
domains with minimal human supervision. Recently, deep reinforcement learning algorithms …

Solving the rubik's cube with approximate policy iteration

S McAleer, F Agostinelli, AK Shmakov… - … Conference on Learning …, 2019 - par.nsf.gov
Recently, Approximate Policy Iteration (API) algorithms have achieved superhuman
proficiency in two-player zero-sum games such as Go, Chess, and Shogi without human …

MM: A bidirectional search algorithm that is guaranteed to meet in the middle

RC Holte, A Felner, G Sharon, NR Sturtevant, J Chen - Artificial Intelligence, 2017 - Elsevier
Bidirectional search algorithms interleave two separate searches, a normal search forward
from the start state, and a search backward from the goal. It is well known that adding a …