About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
October 2003
<<September October November>>
Solution:
Value = 28.3333
0 1 1 0 1 1 0 0 1 1 0 2 2 0 1 1 0 0 3 0 3 0 2 0 1 3 3 0 3 2 2 1 1 2 2 3 0 3 3 1 0 2 0 3 0 3 0 0 1 1 0 2 2 0 1 1 0 0 1 1 0 1 1 0
Each piece is a distinct type. Its hit matrix is the maximum possible, consistent with its appearance here; that is, it is the most powerful piece that does not attack any of the other occupied squres in this particular setup.
Patrick LoPresti and Mat Hostetter have done an exhaustive search to show that there are no solutions better than 28.3333 among boards of the following types:
- All 2^32 boards which are symmetric with respect to reflection
through the center (aka. half-twist).
- All 2^32 boards which are mirror self-images.
- All 2^36 boards which are symmetric about the diagonal.
- All 31 * 2^36 boards which have 16 1's around the edge.
So any board with higher score would have to be asymmetric.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com