Format/typo check 2006/sykes1 + update bugs.md
The bugs.md file has some documented features, not bugs. The README.md file has been typo/format checked. This should complete the review of 2006/sykes1.
This commit is contained in:
1 parent
8c31afdcc8
commit
8f41d4fd26
2 files changed
+40
No files matched your search
@@ -5,6 +5,19 @@ make
|
||||
```
|
||||
|
||||
|
||||
### Bugs and (Mis)features:
|
||||
|
||||
The current status of this entry is:
|
||||
|
||||
```
|
||||
STATUS: INABIAF - please **DO NOT** fix
|
||||
```
|
||||
|
||||
For more detailed information see [2006 sykes1 in bugs.md](/bugs.md#2006-sykes1).
|
||||
|
||||
|
||||
|
||||
|
||||
## To use:
|
||||
|
||||
```sh
|
||||
@@ -215,6 +228,7 @@ In the ASCII output care must be taken with drawing the edges of each
|
||||
this is taken care of by color, which is graded from the back to the
|
||||
front to ensure edge visibility.
|
||||
|
||||
|
||||
### Notes
|
||||
|
||||
The whole program has just one function - `main()` - which is recursively
|
||||
@@ -241,6 +255,7 @@ requirements.
|
||||
The program is known to compile and run under gcc and Intel cc, as well
|
||||
as PellesC on Windows.
|
||||
|
||||
|
||||
### Bugs
|
||||
|
||||
The program is not at all a valid html document, but fortunately
|
||||
|
||||
@@ -2352,11 +2352,36 @@ challenging and in some systems it will not be possible to fix but you are
|
||||
welcome to try and fix it if you wish to!
|
||||
|
||||
|
||||
|
||||
|
||||
### STATUS: INABIAF - please **DO NOT** fix
|
||||
|
||||
Incorrect formulas will ungracefully crash the program.
|
||||
|
||||
|
||||
## 2006 sykes1
|
||||
|
||||
### STATUS: INABIAF - please **DO NOT** fix
|
||||
### Source code: [2006/sykes1/sykes1.c](2006/sykes1/sykes1.c)
|
||||
### Information: [2006/sykes1/README.md](2006/sykes1/README.md)
|
||||
|
||||
The author stated:
|
||||
|
||||
```
|
||||
If you pick a number higher than 19186, the program will return a
|
||||
solution but it will be a rotation of one of the first 19186. This is
|
||||
because the cross shaped piece fits 48 ways in the 4x4 cube, but only
|
||||
2 of those ways are unique - you can rotate one of those to make any
|
||||
of the other 46. The algorithm used always places the cross piece
|
||||
first, so the first two placings of that piece result in the 19186
|
||||
unique solutions.
|
||||
|
||||
If you pick a number higher than 460464 (24x19186) the program will
|
||||
return without outputting a solution. If you can wait that long.
|
||||
```
|
||||
|
||||
|
||||
|
||||
## 2006 toledo2
|
||||
|
||||
### STATUS: INABIAF - please **DO NOT** fix
|
||||
|
||||
Reference in new issue
Block a user