The first test suite problem is troublesome because it requires only 3 moves, and the 3-move solution is not necessarily the first one it finds that has 6 moves or less.
...also, how does the assert(numel(moves)==6) work on the problem that has only 3 moves?
@William: the troublesome test case has been removed. Thanks for pointing that out.
some cases admit shorter solution ^^'
Return the 3n+1 sequence for n
Find the alphabetic word product
Create a vector whose elements depend on the previous element
Celsius to Kelvin
Legend of Zelda - Rupee Count (Compact)
Power Times (of the day)
Rumis Scorer 2
Weighted Gold/Silver Standard
Legend of Zelda - Rupee Count
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