In traditional word melds or word ladders only one letter is changed at a time but still creating a proper word.
Here I wish to build a 3 x 3 hollow tower using alphabetically labeled tiles.
I begin with four 3-letter words as the foundation in a standard crossword format.
When laying the next layer I may change any tiles providing I do not change one that is adjacent to one already changed on that layer. Those not changed are carried to the next layer.
The graphic shows three potential first layer changes:
a) corner cells -right
b) centre cells -left
c) both of the above - lower grid
| B |
I |
G |
|
B |
A |
G |
|
T |
A |
T |
| A |
|
O |
← |
U |
|
E |
→ |
U |
|
E |
| N |
U |
T |
|
N |
I |
T |
|
G |
I |
N |
|
|
|
|
|
↓ |
|
|
|
|
|
|
|
|
|
B |
E |
G |
|
|
|
|
|
|
|
|
I |
|
E |
|
|
|
|
|
|
|
|
N |
I |
M |
|
|
|
|
Given the grid on the left, how do you arrive at that on the right in equal to or fewer layers than 8?
| Layer 1 | | | Layer 8 |
| M |
A |
T |
|
|
S |
K |
Y |
| O |
|
E |
|
|
I |
|
A |
| B |
Y |
E |
|
|
R |
A |
M |
Using this grid as your base show how to build a tower such that every letter in the foundation has been replaced (please no proper nouns).
A collection of positive integers (not necessarily distinct) is called
Kool if the sum of all its elements equals their product.
For example, {2, 2, 2, 1, 1} is a Kool set.
__________________________________
a) Show that there exists a Kool set of n numbers for all n>1
b) Find all Kool sets with sums of 100
c) Find all Kool sets with 100 members.
Latest: 
Bonus: 
