2018-03-26

posted Mar 26, 2018, 6:19 AM by Konstantinovich Samuel
Do Now: 
Take out notebook + calculator
What do you know about the towers of Hanoi?

Piglatin Alice:
Many of you did not follow instructions.
I will allow 2 resubmissions. If you do not resubmit on time, I will not test your code again.
1st pass: I will repost the grades by osis tomorrow. (Mainly for filename fixes)
2nd pass: I will repost the final grades by osis Thursday. (Final fix for people that had trouble)

There were 37 words in the test case, 30 of which were required, 7 were optional.
All tests were case INSENSITIVE, so capitalization was not a factor. 

For reference this was my test file:  (the next test file will be different of course)
Alice was beginning to get very tired of sitting by her sister on the bank.
aXXX
eYYY
iZZZ
oWWW
uXXX
bYYY
cZZZ
dWWW
xVVV
thXXX
chXXX
phXXX
wXXX!
wXXX?
wXXX.
dXXX..
dYYYY...
{fXXX}
"fXXX"
(tXXX)
[[fXXX]]
""uXXX""

Towers of Hanoi Demo:

Towers:
64 golden disks.

How many moves to solve this?

First calculate how many moves are required to solve 
1 disk
2 disks
3 disks
4 disks
n disks?

How long till the universe ends?

What about faster monks?

How is this related to some categories of problems in computer science?

Intractability



Comments