N-d Puzzle.rar
(919.37 KB, 下载次数: 29)
| Contents[hide] |
| Piece Count | |||
| Number of vertices (V) | 8 | Number of 3-colour pieces | 8 |
| Number of edges (E) | 12 | Number of 2-colour pieces | 12 |
| Number of faces (F) | 6 | Number of 1-colour pieces | 6 |
| Number of cells (C) | 1 | Number of 0-colour pieces | 1 |
| Number of coloured pieces (P) | 26 | ||
| Number of stickers | 54 | ||

But P is always one short of this (or the n-dimensional extension of this formula) in the figures given in this article because C (or the corresponding highest dimension polytope, for higher dimensions) is not being counted.| Piece Count[3] | |||
| Number of vertices | 16 | Number of 4-colour pieces | 16 |
| Number of edges | 32 | Number of 3-colour pieces | 32 |
| Number of faces | 24 | Number of 2-colour pieces | 24 |
| Number of cells | 8 | Number of 1-colour pieces | 8 |
| Number of 4-cubes | 1 | Number of 0-colour pieces | 1 |
| Number of coloured pieces | 80 | ||
| Number of stickers | 216 | ||
| Piece Count[3] | |||
| Number of vertices | 16 | Number of 4-colour pieces | 16 |
| Number of edges | 32 | Number of 3-colour pieces | 0 |
| Number of faces | 24 | Number of 2-colour pieces | 0 |
| Number of cells | 8 | Number of 1-colour pieces | 0 |
| Number of 4-cubes | 1 | Number of 0-colour pieces | 0 |
| Number of coloured pieces | 16 | ||
| Number of stickers | 64 | ||
| Piece Count[3] | |||
| Number of vertices | 16 | Number of 4-colour pieces | 16 |
| Number of edges | 32 | Number of 3-colour pieces | 64 |
| Number of faces | 24 | Number of 2-colour pieces | 96 |
| Number of cells | 8 | Number of 1-colour pieces | 64 |
| Number of 4-cubes | 1 | Number of 0-colour pieces | 16 |
| Number of coloured pieces | 240 | ||
| Number of stickers | 512 | ||
| Piece Count[3] | |||
| Number of vertices | 16 | Number of 4-colour pieces | 16 |
| Number of edges | 32 | Number of 3-colour pieces | 96 |
| Number of faces | 24 | Number of 2-colour pieces | 216 |
| Number of cells | 8 | Number of 1-colour pieces | 216 |
| Number of 4-cubes | 1 | Number of 0-colour pieces | 81 |
| Number of coloured pieces | 544 | ||
| Number of stickers | 1000 | ||

| Piece Count[3] | |||
| Number of vertices | 32 | Number of 5-colour pieces | 32 |
| Number of edges | 80 | Number of 4-colour pieces | 80 |
| Number of faces | 80 | Number of 3-colour pieces | 80 |
| Number of cells | 40 | Number of 2-colour pieces | 40 |
| Number of 4-cubes | 10 | Number of 1-colour pieces | 10 |
| Number of 5-cubes | 1 | Number of 0-colour pieces | 1 |
| Number of coloured pieces | 242 | ||
| Number of stickers | 810 | ||
| Piece Count[3] | |||
| Number of vertices | 32 | Number of 5-colour pieces | 32 |
| Number of edges | 80 | Number of 4-colour pieces | 0 |
| Number of faces | 80 | Number of 3-colour pieces | 0 |
| Number of cells | 40 | Number of 2-colour pieces | 0 |
| Number of 4-cubes | 10 | Number of 1-colour pieces | 0 |
| Number of 5-cubes | 1 | Number of 0-colour pieces | 0 |
| Number of coloured pieces | 32 | ||
| Number of stickers | 160 | ||
| Piece Count[3] | |||
| Number of vertices | 32 | Number of 5-colour pieces | 32 |
| Number of edges | 80 | Number of 4-colour pieces | 160 |
| Number of faces | 80 | Number of 3-colour pieces | 320 |
| Number of cells | 40 | Number of 2-colour pieces | 320 |
| Number of 4-cubes | 10 | Number of 1-colour pieces | 160 |
| Number of 5-cubes | 1 | Number of 0-colour pieces | 32 |
| Number of coloured pieces | 992 | ||
| Number of stickers | 2,560 | ||
| Piece Count[3] | |||
| Number of vertices | 32 | Number of 5-colour pieces | 32 |
| Number of edges | 80 | Number of 4-colour pieces | 240 |
| Number of faces | 80 | Number of 3-colour pieces | 720 |
| Number of cells | 40 | Number of 2-colour pieces | 1,080 |
| Number of 4-cubes | 10 | Number of 1-colour pieces | 810 |
| Number of 5-cubes | 1 | Number of 0-colour pieces | 243 |
| Number of coloured pieces | 2,882 | ||
| Number of stickers | 6,250 | ||
| Piece Count[3] | |||
| Number of vertices | 32 | Number of 5-colour pieces | 32 |
| Number of edges | 80 | Number of 4-colour pieces | 320 |
| Number of faces | 80 | Number of 3-colour pieces | 1,280 |
| Number of cells | 40 | Number of 2-colour pieces | 2,560 |
| Number of 4-cubes | 10 | Number of 1-colour pieces | 2,560 |
| Number of 5-cubes | 1 | Number of 0-colour pieces | 1,024 |
| Number of coloured pieces | 6,752 | ||
| Number of stickers | 12,960 | ||
| Piece Count[3] | |||
| Number of vertices | 32 | Number of 5-colour pieces | 32 |
| Number of edges | 80 | Number of 4-colour pieces | 400 |
| Number of faces | 80 | Number of 3-colour pieces | 2,000 |
| Number of cells | 40 | Number of 2-colour pieces | 5,000 |
| Number of 4-cubes | 10 | Number of 1-colour pieces | 6,250 |
| Number of 5-cubes | 1 | Number of 0-colour pieces | 3,125 |
| Number of coloured pieces | 13,682 | ||
| Number of stickers | 24,010 | ||
| Piece Count[5] | |||
| Number of vertices | 600 | Number of 4-colour pieces | 600 |
| Number of edges | 1,200 | Number of 3-colour pieces | 1,200 |
| Number of faces | 720 | Number of 2-colour pieces | 720 |
| Number of cells | 120 | Number of 1-colour pieces | 120 |
| Number of 4-cells | 1 | Number of 0-colour pieces | 1 |
| Number of coloured pieces | 2,640 | ||
| Number of stickers | 7,560 | ||
This calculation of achievable combinations has not been mathematically proven and can only be considered an upper bound. Its derivation assumes the existence of the set of algorithms needed to make all the "minimal change" combinations. There is no reason to suppose that these algorithms will not be found since puzzle solvers have succeeded in finding them on all similar puzzles that have so far been solved. Nevertheless, as of May 2008, the puzzle has neither been solved nor all the algorithms found needed for the final proof.| Piece Count[3] | |||
| Number of vertices | 4 | Number of 2-colour pieces | 4 |
| Number of edges | 4 | Number of 1-colour pieces | 4 |
| Number of faces | 1 | Number of 0-colour pieces | 1 |
| Number of coloured pieces | 8 | ||
| Number of stickers | 12 | ||
Note that the centre pieces are in a fixed orientation relative to each other (in exactly the same way as the centre pieces on the standard 3×3×3 cube) and hence do not figure in the calculation of combinations.
附件: N-d Puzzle.rar (2009-1-1 00:27:28, 919.37 KB) / 下载次数 29
现在可以回了!

| 欢迎光临 魔方吧·中文魔方俱乐部 (http://www.mf8-china.com/) | Powered by Discuz! X2 |