The unreachable, the impossible, the multidimensional…

Level five of Conway’s Soldiers.

Before we start the boring post, there are already videos on the Conway’s Soldiers, so check them out if you don’t want to read this!

There is an infinite field, with infinite soldiers (as many as you need), but finite moves. Their job is to infiltrate over the line. It’s like checkers, except horizontally and vertically instead of diagonally. Only one jump may happen at a time. The jumped pieces are removed. The board:

This is after the first move, in which the odd colour soldier is the jumped soldier and this is level 1 reached.

With infinite soldiers and an infinite field, it seems like the soldiers can reach infinity. But no!

There is proof that level five is impossible. This was proved by the creator himself, John Horton Conway. The proof is on Wikipedia, but I’ll try to explain it myself:

There exists a number similar to phi where:

{\displaystyle \varphi ={\frac {{\sqrt {5}}-1}{2}}\approx 0.61803\,39887\ldots }

φ^2 = 1 – φ (I tried to copy a lowercase phi, but it all changes to the uppercase, so instead of the phi symbolised above, it will be φ).

In the other side to the soldiers, if we mark the target square (one square in level 5) with φ^0 (aka 1), and the surrounding squares with φ^n (where n is the Manhattan distance to the target square). There is a “score” of the configuration of the soldiers by totalling the value of the soldiers’ squares. So if there were two soldiers positioned to reach the target square on the next move, the configuration “score” would be φ^1 + φ^2.

There are three possible moves:

  • The jump towards the target square changes the score by 0.
  • The jump that changes nothing changes the score by -φ^(n+1).
  • The jump further away from the target changes the score by -2φ^(n+1).

Therefore, the score will never increment, because φ is positive.

The configuration score of a row of soldiers directly underneath the target square is φ + 2φ^2 + 2φ^3 + 2φ^4 + 2φ^5 + 2φ^6 + …, and the score for a row of soldiers n spaces below the target square is {φ^(n – 1)} * (φ + φ^2 + φ^3 + φ^4 + …).

Remember how φ^2 = 1 – φ? New fact, where:

\sum _{{n=2}}^{{\infty }}\varphi ^{n}=1
Interesting!

So is the target square is in level one, the score with no moves is: S(1) = {φ + 2(φ^2 + φ^3 + φ^4 + …)} * (1 + φ + φ^2 + φ^3 + …) Side note: the number in the score “function” is usually subscripted (small and lower), but WordPress won’t allow it so :v

Using the sigma function from above, we get S(1) = (φ + 2) * (1 + φ + 1) = (φ + 2)^2 = 5 + 3φ.

Since the difference between two conjoined squares is φ, to get the value of S(n), it is φ * S(n-1).

  • S(2) = 3 + 2φ
  • S(3) = 2 + φ
  • S(4) = 1 + φ
  • S(5) = 1

When a soldier reaches the target square T, the ending score is E = φ^0 + ε, where φ^0 is the contribution of the soldier on the target square, and ε is the contribution of the soldiers behind the line (our region). ε is small but always positive.

The starting configuration score is S(5) = 1, and the ending configuration score is E = 1 + ε, and this leads to a contradiction, since S(5) < E because ε is always positive, and the score never increases, so S(5) ≥ E, but a number cannot be smaller than another number that is smaller than or equal to that number.

But

hold

UP!!!!!!!!!!!!!!!!!!!!!!

Simon Tatham and Gareth Taylor proved that the impossible level 5 in Conway’s Soldiers is actually possible! Now if your first thought is, “how can that be true when Conway proved that it is impossible?” And you’re right. It uses up every soldier on the infinite board. We just have to tweak the rules and manipulate time a little bit.

If this doesn’t make sense, go to the link at the bottom, with all the links I used.

I’m not taking any credit for this solution, the credit goes to Simon Tatham and Gareth Taylor.

Think of making a large amount of moves in parallel, so using a full row of soldiers to get every one of them into level one. Not helpful, but it springs a new concept:

Doing a similar concept, but along one row. If a finite number of soldiers were in one row without any gap in between, the first one (far right) can be jumped by the second, the third by the fourth, the fifth by the sixth, and so one. First tweak! If an infinite number of moves can be made in finite time, that is legal. So the first jump in the second concept can be done at time t=0, the second jump at t=1/2, the third at t=3/4, the fourth at t=7/8, and so on, and at t=1, all jumps have been made, with time to spare. We made infinite moves in one second!

Now, we can only move one soldier at a time, so the idea of making large amounts of moves at once is scrapped, but if we take the “infinite moves, finite time” approach, we could do it in 1 second. We don’t know if t’s units of measurement is seconds, minutes or days, let’s call it arbunit (Arbitary Time Unit).

Another useful move that can be used is a reversed infinite sequence, or an ecneuqes etinifni. A clear end, but an uncertain beginning, and this strategy is very useful. We can visualise one soldier after consecutive jumps as we did in the second approach to the infinite sequence jump, but reversed. The two people created an awesome sequence which Gareth Taylor called a “whoosh”, most likely because it does look like a whoosh. In one row, the second jumps the first, fourth jumps third, and so on, until there are two soldiers at the left “end”, then the second part of the whoosh begins, where the leftmost soldier jumps over every soldier in the line until it finishes the rightmost jump, and is left alone after the whoosh.

The finite time? The first half of the whoosh can be done in one second, then the second half in another second, in the “keep halving and add, get 1” way, but in the second half, multiplying by two until reaching one arbunit.

Now, to advance further, Gareth Taylor and Simon Tatham created a “megawhoosh”, where it could literally turn a “quarter-plane” of soldiers into one soldier using a series of whooshes. The problem was that the megawhoosh only took the soldier to level two, so the two people started with a soldier at level three and worked their way backwards, doing one reverse jump, then reverse-whooshing both soldiers. If visualising it is hard, the visualisation is in the website linked down below. Move the left soldier left by reverse-jumping, then reverse-whoosh again.

Repeat infinitely, with the “halve every time” time management tool to fill the staircase of soldiers.

After the infinite whooshing, take every other soldier and whoosh them to the left, and then reverse-jump the soldiers to fill the gaps, which only takes a finite amount of steps in each column.

When that is done, the “quarter-plane” will be filled, and that is the reverse-megawhoosh. Now, to use the megawhoosh, do the exact same thing explained above, but in reverse.

Now, for the grand solution that Simon Tatham and Gareth Taylor devised!

  1. Draw a line in the middle, where the final soldier will end up on the fifth level.
  2. Megawhoosh the left half (not including the middle line) up to level three.
  3. In the column that the line was drawn on, whoosh the column to level two, then jump the level three soldier to get to level four.
  4. Megawhoosh the right half to level three, like the left half, then jump the soldier directly above the result of the second megawhoosh to reach level five.

Credits:

This was pain to write, but definitely not as much as Simon Tatham and Gareth Taylor when they had to find the manipulated solution to Conway’s Soldiers.

QED.

P.S. I want to post the gif for the solution provided by the two people who found the solution, but for legal reasons, I won’t. Check out the website for the animation, or this link.

Also, none of this information originates from me.

Which is closer to 16: 32 or 17?

In a +1 way, it’s 17.

But in a PRIME FACTOR way, it’s 32.

Why? And which is it?

  • Kindergarten kids: 17
  • Primary: 17
  • Middle School: 17
  • High school: 17
  • College: probably both, but more likely 17
  • University: 15? 17? 32? WHAT?!?!?!?!
  • Real-life mathematicians who only care about supernaturals: 32

(screech sound)

What on Earth is a SuPeRnAtUrAl?!?!?!?!?!?!?!?!

If you watch Vi Hart’s video “How many types of infinity are there?” at 9:04, it says “supernatural” numbers. You know indices, x to the power of y? if y is infinity, for any real x bigger than 1 will be infinite. The +1 definition sees 2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*… the same as 7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*7*…, but in the supernaturals, the 7*7*7*7*7*7*7*7*7*7*… is bigger, because they are multiplied the same infinite amount, and every time, 2<7, 4<49, etc.

So in the supernatural way, the number 16 is closer to 32 than 17 because 16 and 32 are just times 2 away, while 17 is… well, does not have a common factor at all.

That’s good!

Q.E.D.

Some great math webs/books

Webs:

Books:

Oh wait, youtube channels!!!!!

That’s all folks. But if you have any favorite math web, book or YouTube channel, comment below.

Right, bye guys!

😊😊😀😂😊😃🤣😁😍😜😆😋😄😅😆😃😉😊😋😎😏😮😶🤩

Conway’s game of life

Do you know about conway’s game of life?????

The Conway’s game of Life has certain rules:

  • the grid is a square grid.
  • If a Square is black, then the square is alive. If not, it’s dead. (no grey cells!)
  • If an alive square has two or three alive neighbours, it will be alive in the next ‘generation’.
  • If a dead square has EXACTLY three neighbours that are alive, then the square becomes alive in the next ‘generation’.
  • If a square dies or does not become alive in the next generation, it is considered DEAD.

An animation:

File:Gospers glider gun.gif

And a Google Easter egg:

Search up Conway’s game of life and a version of conway’s game of life will show up. 😱😱😱😱😱😱😱😱😱😱😱😱😱😵😵😵😵😝😵😵😵😵😵😵😵😵😲😲😲😲😲😲😱😱😱😱😱😱😱😱😱😱😱😨😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵😵

How many people can be fed 0 pizzas each?

I mean, it’s just stupid, right? 0 pizzas for everyone. But it’s actually this question:

CAN YOU DIVIDE BY ZERO?!?!?!?!

The answer: NO.

Answers:

  • Let’s say you had a pizza. If you invited only yourself, then you could have all the pizza! If you invited 9 friends, you could have 1/10 of a pizza! If you actually had 999 other people at your party (are you trying to socialise or do you actually have that many friends?), you would only have 1/1000 of a pizza. If you (meanly) wanted everyone to have 0 pizza parts, how many people? Undefined!
  • So, 12/0 is SOMETHING, right? Let’s say 12/0=x. Then 0x = 12, but that’s not possible because anything multiplied by 0 is 0! (not 0 factorial)
  • 12/4 = 3, right? And 56/7 = 8, right? Multiplication is basically repeated addition, and division is the inverse function of multiplication. So 5/0 = um, 0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0+0 = STILL ZERO!!!!! SO 5 could not be reached.

So any number divided by 0 is undefined.

Q.E.D.

P.S. this wasn’t a proof, so I could remove that lovely Quod Erat Demonstrandum.

0^0

Yes, your fears are confirmed. What is zero to the power of ZERO?

In fact, it is undefined. But why do some webs say it’s 1?

Technically, it goes towards 1.

  • 0 to the power of any number is 0, right?
  • any number to the power of 0 is 1, right?
  • What if you put them together?
  • take a limit
  • 1^1 = 1 (obv.)
  • three decimal places
  • 0.9^0.9 = 0.909
  • 0.8^0.8 = 0.836
  • 0.7^0.7 = 0.779
  • 0.6^0.6 = 0.736
  • 0.5^0.5 = 0.707
  • 0.4^0.4 = 0.693
  • 0.3^0.3 = 0.696
  • 0.2^0.2 = 0.724
  • 0.1^0.1 = 793
  • Going on forever, it approaches 1

WOW!

Maths in chess!!!!!

Here is a list of chess math stuff.

  • There are about infinitely many games possible of chess.
  • The longest checkmate puzzle can be found to be a 1220-move mate. Can be found here.
  • The shortest checkmate is in two moves, black mates white.
  • There are 64 squares on a chess board. Terms and Conditions apply.
  • If you are a math wiz, you will know that the grid is a square, and is 8×8.
  • A knight can visit all 64 squares, which isn’t that related to mathematics.
  • There are about 10000000000000000000000000000000000000000000 games of 40 moves or lower.
  • The 100/2 (aka 50) move rule (no, it’s not called ‘the 100/2 move rule’, it’s the 50 move rule) states that, well, um, uh …
  • The slope of the direction the bishop moves is either 1 or -1.
  • Slope of knight? Um, That is either 2, 1/2, -2 or -1/2.

Terms and Conditions!

I did say that there are 64 squares on a chessboard. NOT STRICTLY TRUE! What about 3×3, 2×2, 4×4, 5×5, etc.???

Add ’em all up and it’s 204 squares.

😀😀😀😀😀😀😀😀😀😀😀😀😀😀😀😄😀😄😀😀😀😀😀😄😀😄😆😁😀😄😀😄😀😀😄😀😄😀😄😀😄😀😄😀😄😀😄😀😄😀😄😀😄😀😄😃😊😃😄😀😄😀😄😀😄😆😁😆😀😄😆😄😆😁😆😀😉😆😁😄😀😄😀😆😁😀😆😁😀😆😀😆😁😁😀😁😀😁😀😁😀😁😀😁😀😁😀😁😀😁😀😁😀😁😀😊😉😅😆😅😆😅😆😁