项目描述 ：
Using meet in the middle brute force to solve a 2 by 2 Rubik's cube. Once the puzzle is solved a shortest route algorithm is applied to find the shortest path.

高级语言： C#

项目主页：

项目地址: git://github.com/achmand/Solving-2x2-Rubiks-Cube.git

创建时间： 2017-04-14T00:53:12Z
项目社区：https://github.com/achmand/Solving-2x2-Rubiks-Cube
开源协议：
下载