Problem 327. TRON challenge

Created by Alfonso Nieto-Castanon

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/image","targetMode":"","relationshipId":"rId1","target":"/media/image1.png"}],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Create a solver for the classic arcade TRON game</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:customXml w:element=\"image\"><w:customXmlPr><w:attr w:name=\"height\" w:val=\"-1\"/><w:attr w:name=\"width\" w:val=\"-1\"/><w:attr w:name=\"relationshipId\" w:val=\"rId1\"/></w:customXmlPr></w:customXml></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Description</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Your function should return the next move of your bike ('light cycle' if you prefer) for any given state of the board.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The board is described by a 50x50 matrix, with values:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ 0: empty space\n 1: your bike (bright blue dot on the figure above)\n 2: your opponents bike (bright red dot)\n -1: walls created by your bike (blue lines)\n -2: walls created by your opponents bike (red lines)\n -3: external walls (white)]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Your bike's next move is described by a single character:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ 'N': moves up (next lower row)\n 'S': moves down (next higher row)\n 'W': moves west (next lower column)\n 'E': moves east (next higher column)]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For each challenge, both bikes will start at a random position at the border of the board. Your solver will be called iteratively against a default solver (implementing a simple collision avoidance procedure). The last person standing after the other crashes against a wall is the winner. Your solver needs to be able to win 90 out of 100 challenges.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>notes</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For the purpose of collision detection both bikes are considered to move simultaneously for each iteration. A collision of the two bikes is considered a tie (not a win).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Whether you pass or not the tester will let you know how many wins/ties/looses your code accomplished against the default solver. Your score will be</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>100 - #Wins + #Looses</w:t></w:r><w:r><w:t> (a score of 0 means you won all 100 challenges)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If you wish to display the challenges graphically copy and paste the evaluation code on your computer and change the first line to 'doDraw=true;'</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"},{"partUri":"/media/image1.png","contentType":"image/png","content":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAASwAAADhCAIAAAD9Hh/8AAAEjElEQVR42u3YP2sTcRzH8Y9goBUqpi6uujhnKUiJaNsH0UXRJ6DoUP/QYmsVwcHn0GdQ3Eo5tJo5m1sJfQLNoDjX60EllRIczEXN631fyOV3U47fizuSSJIkSZIkSZIkSZIkSZIkSZIkSZIk/c01Go1ZaWgzMzOkjLB2u30oDW17e5uUEba4uHgkDW1vb4+UEbawsGCTaXhFUZBSE8Jut1tMQF+K4qAoegNTfu2Wx6/L5ewXxYdiUuv3+xDWjXB+fn4SfvJyspE8H5jN5EZ5HH8OLq8mjyZ5b+zu7kJYN8LyfBJ+8t3kdfJiYN4kt8rj+HNwuaS6kkxN7N4o7UEI4Ui6n7xNXlUPvt9AOA0hhBD+4a4k15KryfXkabIOIYQQjqvzFbINCCGEcFxNn0J4u3pL3ahmHUIIIawf4XyyVi2sVCcQQghh3QgbyYVqrZx71R+oEEIIYa0IB7sDIYQQjhfhXQghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCAUhhBBCCCGEghBCCCGEEEJBCCGEEEIIoSCEEEIIIYRQEEIIIYQQQigIIYQQQgghFIQQQgghhBAKQgghhBBCCAUhhBBCCCGEghBCCCGEEEJBCCGEEEIIoSCEEEIIIYRQEEIIIYQQQigIIYQQQgghFIQQQgghhBAKQgghhBBCCAUhhBBCCCGEghBCCCGEEEJBCCGEEEIIoSCEEEIIIYRQEEIIIYQQQigIIYQQQgghFIQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIoSCEEEIIIYRQEEIIIYQQQigIIYQQQgghFIQQQgghhBAKQgghhBBCCAUhhBBCCCGEghBCCCGEEEJBCCGEEEIIoSCEEEIIIYRQEEIIIYQQQigIIYQQQgghFIQQQgghhBAKQgghhPBfRricrCXPkgfJFIQQQlg/wnfJp+Rj8j65CCGEENaP8HNyVM335DKEEEJYP8LiBGE/mYUQQghHiPBxsppsJjdPXel4EkIIYR1dSrpJLzlIHp660ipvTDXtpAEhhBCOqvJF89vJI2/TVoAQwrEg/HqC8KWtACGE9ddM9pPDap7YChBCWH/nKoez1UzbChBCKAghhFAQQigIIXRDBCGEghBCCUIIBSGEEoQQCkIIBSGEEApCCAUhhBAKQggFIYQQCkIIBaEgFIQQCkJBKAghFISCUBBCKAgFoSCEUBAKQkEIoSAUhIIQQkEoCAUhhIJQEApCCAWhIBSEEApCQSgIIRSEglAQQigIBaEghFAQCkJBCKEgFISCEEJBKAgFIYSCUBAKQggFoSAUhBAKQkEoCCEUhIJQEEIoCAWhIIRQEOoshHNzc26IfrazswNh3Qi3trbWpZN6vR6EdSOUzgxCCAXhf93S0pJNpuF1Oh1SRliz2VyQhtZqtUiRJEmSJEmSJEmSJEmSJEmSJEmSJEmSJEmSJEmSJEmSVHM/AMFnLIrZmb9yAAAAAElFTkSuQmCC"}]}

Create a solver for the classic arcade TRON game<img src = "http://www.alfnie.com/software/figtron.png">DescriptionYour function should return the next move of your bike ('light cycle' if you prefer) for any given state of the board.The board is described by a 50x50 matrix, with values:<pre> 0: empty space
 1: your bike (bright blue dot on the figure above)
 2: your opponents bike (bright red dot)
 -1: walls created by your bike (blue lines)
 -2: walls created by your opponents bike (red lines)
 -3: external walls (white)</pre>Your bike's next move is described by a single character:<pre> 'N': moves up (next lower row)
 'S': moves down (next higher row)
 'W': moves west (next lower column)
 'E': moves east (next higher column)</pre>For each challenge, both bikes will start at a random position at the border of the board. Your solver will be called iteratively against a default solver (implementing a simple collision avoidance procedure). The last person standing after the other crashes against a wall is the winner. Your solver needs to be able to win 90 out of 100 challenges.notesFor the purpose of collision detection both bikes are considered to move simultaneously for each iteration. A collision of the two bikes is considered a tie (not a win).Whether you pass or not the tester will let you know how many wins/ties/looses your code accomplished against the default solver. Your score will be 100 -
 #Wins + #Looses (a score of 0 means you won all 100 challenges)If you wish to display the challenges graphically copy and paste the evaluation code on your computer and change the first line to 'doDraw=true;'

Create a solver for the classic arcade TRON game

<<http://www.alfnie.com/software/figtron.png>>

*Description*

Your function should return the next move of your bike ('light cycle' if you prefer) for any given state of the board.

The board is described by a 50x50 matrix, with values:

0: empty space
   1: your bike (bright blue dot on the figure above)
   2: your opponents bike (bright red dot)
  -1: walls created by your bike (blue lines)
  -2: walls created by your opponents bike (red lines)
  -3: external walls (white)

Your bike's next move is described by a single character:

'N': moves up (next lower row)
   'S': moves down (next higher row)
   'W': moves west (next lower column)
   'E': moves east (next higher column)

For each challenge, both bikes will start at a random position at the border of the board. Your solver will be called iteratively against a default solver (implementing a simple collision avoidance procedure). The last person standing after the other crashes against a wall is the winner. Your solver needs to be able to win 90 out of 100 challenges.

*notes*

For the purpose of collision detection both bikes are considered to move simultaneously for each iteration. A collision of the two bikes is considered a tie (not a win).

Whether you pass or not the tester will let you know how many wins/ties/looses your code accomplished against the default solver. Your score will be _100 -
 #Wins + #Looses_ (a score of 0 means you won all 100 challenges)

If you wish to display the challenges graphically copy and paste the evaluation code on your computer and change the first line to 'doDraw=true;'

Solve

Solution Stats

151 Solutions
16 Solvers

Last Solution submitted on Mar 05, 2021

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

@bmtran (Bryant Tran) on 17 Feb 2012

Love the problem, love the graphics, great write-up, and great concept. awesome^2

Alfonso Nieto-Castanon on 18 Feb 2012

Thanks!!

Highphi on 10 Aug 2020

Whew! Toughie. Great problem.
Only complaint is 'loose' is what you call your shoelaces when you trip over them ;)

Solution Comments

Solution 1372468

1 Comment

1 Comment

Heather Donatelli on 7 Dec 2017

cool

Solution 582568

1 Comment

1 Comment

Binbin Qi on 15 Feb 2015

98-1-1

Solution 565822

1 Comment

1 Comment

Jan Orwat on 26 Jan 2015

99-0-1

Solution 102925

1 Comment

1 Comment

Tom on 26 Jun 2012

91-2-7

Solution 97424

1 Comment

1 Comment

Richard Zapor on 11 Jun 2012

W 97 t 1 looses 2

Solution 97247

1 Comment

1 Comment

Richard Zapor on 11 Jun 2012

W 97 t 1 Looses 2

Solution 97142

1 Comment

1 Comment

Richard Zapor on 10 Jun 2012

W 100 t 0 Looses 0 vs Base 327 bot
Crushes RAZ CCW Gap001 83 / 1 /16
RAZ CCW Gap allows max of 46 wins against bots to date 6/9/2012
Mid-Level Bot

Solution 97141

1 Comment

1 Comment

Richard Zapor on 9 Jun 2012

W 98 t 1 L 1

Solution 97140

1 Comment

1 Comment

Richard Zapor on 9 Jun 2012

Wins 898 Ties 1 Looses 1

Solution 97111

1 Comment

1 Comment

Richard Zapor on 9 Jun 2012

Wins 100

Solution 97108

1 Comment

1 Comment

Richard Zapor on 9 Jun 2012

Wins 100

Solution 96949

1 Comment

1 Comment

Richard Zapor on 9 Jun 2012

wins 98 ties 1 looses 1
Generalized solution to any square board size >9

Solution 96946

1 Comment

1 Comment

Richard Zapor on 8 Jun 2012

Wins 98 Ties 1 Looses 1

Solution 96945

2 Comments

2 Comments

Richard Zapor on 8 Jun 2012

Wins 98 Ties 1 Looses 1

Tom on 25 Jun 2012

Size of 28? How'd you do this? Even the bot is more nodes than this.

Solution 96761

1 Comment

1 Comment

Richard Zapor on 8 Jun 2012

95 1 4

Solution 96759

1 Comment

1 Comment

Richard Zapor on 8 Jun 2012

97-1-2

Solution 96758

1 Comment

1 Comment

Richard Zapor on 8 Jun 2012

98-1-1

Solution 47737

1 Comment

1 Comment

Igor on 21 Feb 2012

92 wins; 1 ties; 7 looses. But certainly not the most concise...

Solution 43444

2 Comments

2 Comments

@bmtran (Bryant Tran) on 17 Feb 2012

91 wins; 1 ties; 8 losses

Alfonso Nieto-Castanon on 18 Feb 2012

very sneaky!

Problem Recent Solvers16

Problem Tags

game strategy tron

Community Treasure Hunt

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

Start Hunting!