It's not, brute (well the brutest) force will explore all possible path.
The number of possible path grows much faster than m (I'd say exponentially)°.
(... but with such a small triangle that's only of theoretical interest )
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
°) sure it's p = 2**(n-1)
In reply to Re^4: Brute force vs algorithm (PWC # 100)
by LanX
in thread Brute force vs algorithm (PWC # 100)
by 1nickt
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |