Detect whether your lightcycle is on same side of existing walls as opponents lightcycle. This function is useful in toggling a tron algorithm from agressive/strategic mode (chasing and hassling opponent) to passive/efficiency mode (wherein you'd presumably focus on using up remaining space, and wouldn't have to bother tracking opponent, etc.). Inspired by Alfonso Nieto-Castanon's Problem 327, as well as Richard Zapor's followups.
input: 50 by 50 matrix of lightcycle and wall positions, empty space = 0, lightcycles = 1 & 2, outer walls = -3, lightcycle trails/walls = -1 and -2.
output: true if on same side, or false if no path exists between the two light cycles.
Suggestion on implementation. Usage of persistent with a flag that bikes are isolated will save time.
Anyone knows why I cannot change recursion limit by set(0,'RecursionLimit',1200)? As far as I recall, I had done it before in Cody. Has Cody blocked access to this option?
Hello Rifat. I've made some tests and had no problem to change 'RecursionLimit' to 1200 although for a very simple function I've been able to do up to 993 recursions, but for any higher number cody server returned 'temporary unavailability of MATLAB Service' error. Please note that this problem occured when a function which was using recursion were changeing 'RecursionLimit' by itself (even if 'set(...' is called only once). When limit was changed from main function and a subfunction was recursed, or when limit was changed from testsuite everything works normal.
yes.. I changed recursion limit from the subfunction. thanks for the tips.. :)
Recursive Grow Flood Fill
Least common multiple of many numbers
159 Solvers
2274 Solvers
107 Solvers
Back to basics 16 - byte order
148 Solvers
Wind outward from the center ...
54 Solvers