Problem 776. TRON strategy toggle

Created by Christopher

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>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</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"\"><w:r><w:t>Problem 327</w:t></w:r></w:hyperlink><w:r><w:t>, as well as Richard Zapor's followups.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>input: 50 by 50 matrix of lightcycle and wall positions, empty space = 0, lightcycles = 1 &amp; 2, outer walls = -3, lightcycle trails/walls = -1 and -2.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>output: true if on same side, or false if no path exists between the two light cycles.</w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 165px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 406.5px 82.5px; transform-origin: 406.5px 82.5px; vertical-align: baseline; "><div style="block-size: 84px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383.5px 42px; text-align: left; transform-origin: 383.5px 42px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 365.8px 7.75px; transform-origin: 365.8px 7.75px; unicode-bidi: normal; "><span style="">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</span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 2.06667px 7.75px; transform-origin: 2.06667px 7.75px; unicode-bidi: normal; "><span style=""> </span></span><a target='_blank' href = "/#null"><span style=""><span style="">Problem 327</span></span></a><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 123.483px 7.75px; transform-origin: 123.483px 7.75px; unicode-bidi: normal; "><span style="">, as well as Richard Zapor's followups.</span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383.5px 21px; text-align: left; transform-origin: 383.5px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 380.267px 7.75px; transform-origin: 380.267px 7.75px; unicode-bidi: normal; "><span style="">input: 50 by 50 matrix of lightcycle and wall positions, empty space = 0, lightcycles = 1 &amp; 2, outer walls = -3, lightcycle trails/walls = -1 and -2.</span></span></div><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383.5px 10.5px; text-align: left; transform-origin: 383.5px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 264.533px 7.75px; transform-origin: 264.533px 7.75px; unicode-bidi: normal; "><span style="">output: true if on same side, or false if no path exists between the two light cycles.</span></span></div></div></div>

Solve

Solution Stats

62 Solutions
17 Solvers

Last Solution submitted on Feb 12, 2023

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

Richard Zapor on 20 Jun 2012

Suggestion on implementation. Usage of persistent with a flag that bikes are isolated will save time.

rifat on 26 Jan 2015

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?

Jan Orwat on 26 Jan 2015

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.

rifat on 26 Jan 2015

yes.. I changed recursion limit from the subfunction. thanks for the tips.. :)

Solution Comments

Show comments

Problem Recent Solvers17

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 776. TRON strategy toggle

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers17

Suggested Problems

More from this Author3

Problem Tags

Community Treasure Hunt

Problem 776. TRON strategy toggle

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers17

Suggested Problems

More from this Author3

Problem Tags

Community Treasure Hunt

Players