Since Cody, I dislike for-loops, but your solution is way simpler than my own algorithm. Mission accomplished...
Nevertheless, I would hope for a non-looped piece of code. Let's see in phase 3.
Count from 0 to N^M in base N.
Back to basics 8 - Matrix Diagonals
Pentago: find winning move
Insert structure in a parameter-cell array.
Convert nested struct-array to numeric array
Wayfinding 4 - Crossing, level 2
Wrap a vector, but insert NaN's at the wrap-positions.
Make a KITT-scanner on the command line
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