very cool, love the problem!
Agreed, although (unlike you) I'm not clever enough to solve it without a joystick...
FOR THOSE WHO WANNA MAP IT AS YOU GO, for shigs
I already made the map for ya (DL the png, the fig takes more mem. to load in)
Easy as ...
map1 = imread('Map1.png');
map1 = imresize(map1, [M*18, N*18]);
Then when you're plotting your points, multiply the coordinate by 18 and shift x by -8 and y by +9
xShift = -8; yShift = 9;
x = j*18 + xShift; y = (M-i+1)*-18 + M*18 + yShift;
Fun stuff. Haven't solved the problem yet but I'm loving it (spending too much time on the graphics probably :D )
OH and the RGB for the ghosts is...
gh1 = [1 0 0]; % BLINKY (red)
gh2 = [20 299 228]/255; % INKY (blue)
gh3 = [226 147 228]/255; % PINKY (pink)
gh4 = [228 153 59]/255; % CLYDE (orange)
Implement a ROT13 cipher
the fly, the train, the second train, and their Zeno's paradox
Back to basics 6 - Column Vector
Back to basics 8 - Matrix Diagonals
Mastermind I: Solve all 1296 cases
Create array of all Distances between two Sets of Points : No Neural Network Toolbox
Access a web hosted copy of the Tiles Contest MAT file
Battleship_000 : (TM) Classic Game - Easy computer bot
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office