Browse State-of-the-Art › Rubik's Cube
Rubik's Cube
17 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Solving the Rubik's Cube is a pathfinding task on a massive implicit graph.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
17 shown of 17 papers with code (37 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
28 Oct 2020 9 repositories listed Syntology ran 0 of 1 samples · 1 unverified · 1 pointer-only (licence)To this end, we summarize a tiny formula for downsizing neural architectures through a series of smaller models derived from the EfficientNet-B0 with the FLOPs constraint.
-
18 May 2018 9 repositories listed Syntology ran 4 of 4 samples · 0 unverified · 4 pointer-only (licence)A generally intelligent agent must be able to teach itself how to solve problems in complex domains with minimal human supervision.
-
19 Apr 2021 4 repositories listed Syntology ran 1 of 10 samples · 9 unverifiedSymmetries and equivariance are fundamental to the generalization of neural networks on domains such as images, graphs, and point clouds.
-
26 May 2023 2 repositories listedLevin Tree Search (LTS) is a search algorithm that makes use of a policy (a probability distribution over actions) and comes with a theoretical guarantee on the number of expansions before reaching a goal node,…
-
16 Oct 2019 2 repositories listedWe demonstrate that models trained only in simulation can be used to solve a manipulation problem of unprecedented complexity on a real robot.
-
18 Feb 2025 1 repository listedThe paper proposes a novel machine learning-based approach to the pathfinding problem on extremely large graphs.
-
24 Jan 2025 1 repository listedIn view of the gap in the current large language model in sharing memory across dialogues, this research proposes a wormhole memory module (WMM) to realize memory as a Rubik's cube that can be arbitrarily retrieved…
-
14 Sep 2024 1 repository listedWhile model-based reinforcement learning methods learn world models that can then be used for planning, such approaches are limited by errors that accumulate when the model is applied across many timesteps as well as…
-
9 Jun 2024 1 repository listed Syntology ran 11 of 15 samples · 4 unverifiedTo fill this gap, we propose Flow of Reasoning (FoR), an efficient diversity-seeking LLM finetuning method aimed at improving reasoning quality and diversity with minimal data.
-
17 Jul 2023 1 repository listedThe problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis.
-
28 Jun 2022 1 repository listedSATNet is a differentiable constraint solver with a custom backpropagation algorithm, which can be used as a layer in a deep-learning system.
-
1 Jun 2022 1 repository listedComplex reasoning problems contain states that vary in the computational cost required to determine a good action plan.
-
28 Apr 2022 1 repository listedRecently, the seminal algorithms AlphaGo and AlphaZero have started a new era in game learning and deep reinforcement learning.
-
25 Aug 2021 1 repository listedIn this paper, we implement kSubS using a transformer-based subgoal module coupled with the classical best-first search framework.
-
6 Jun 2021 1 repository listedExisting combinatorial search methods are often complex and require some level of expertise.
-
20 Jan 2020 1 repository listedIn problem-solving, a path towards solutions can be viewed as a sequence of decisions.
-
11 Jan 2019 1 repository listedWe finally design a Rubik's cube robot and construct a dataset to illustrate the efficiency and effectiveness of our online methods and to indicate the ineffectiveness of offline method by color drifting in our dataset.
Syntology lines on 4 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections