Problem 2005. BattleShip - Seaman (1) thru Admiral(6) : CPU Time Scoring(msec)

Created by Richard Zapor

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":[],"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:hyperlink w:docLocation=\"http://www.conceptispuzzles.com/index.aspx?uri=puzzle/battleships\"><w:r><w:t>Games Magazine Battleships</w:t></w:r></w:hyperlink><w:r><w:t> is a logic puzzle to find the Fleet given some map information and the number of Ship cells in every column and row. The fleet is made of a Battleship(4), two Cruisers(3), three Destroyers(2), and four Submarines(1). Thus the total filled cells is 20.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is to complete three full sets of Battleship in minimal time.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Map information contains Water(0), Subs(1), Middle of a ship(6), Unknown(7), and the Aft(rear) of a ship. Ship going Up(2), Down(3), Left(4), and Right(5).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Ships have no diagonal or UDLR adjacency. The best way in Seaman to deal with Midship segments is to determine where it can not go to determine an orientation.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The map is ringed by zeros to make m a 12x12 array.</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>Input:</w:t></w:r><w:r><w:t> m,r,c; m 12x12 of map values, r(12,1) of row sums, c(1,12) of col sums</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>Output:</w:t></w:r><w:r><w:t> b; A binary 12x12 array</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>Scoring:</w:t></w:r><w:r><w:t> Total Time (msec)</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>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[r=[0 2 0 2 2 2 3 2 3 0 4 0]';\nc=[0 4 0 3 1 3 1 4 0 1 3 0];\n\nm b\n000000000000 000000000000\n077757777770 000011000000\n077777777770 000000000000\n077777777770 000100010000\n077777777770 000100010000\n077777777770 010000010000\n077777777770 010000010010\n027777777760 010000000010\n077777777770 000101000010\n077777777770 000000000000\n077777477770 010001100100\n000000000000 000000000000]]></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>Algorithm:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[1) Initialize processing array based upon input matrix.\n2) Implement a cycling check of driven array changes\n3) Quick Test of Change every single Unknown serially\n4) Evolve and check if complete solution created\n5) Robustly recursively check all potential Battleships, Cruisers, Destroyers, Subs]]></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>"}]}

<a href = "http://www.conceptispuzzles.com/index.aspx?uri=puzzle/battleships">Games Magazine Battleships</a> is a logic puzzle to find the Fleet given some map information and the number of Ship cells in every column and row. The fleet is made of a Battleship(4), two Cruisers(3), three Destroyers(2), and four Submarines(1). Thus the total filled cells is 20.This Challenge is to complete three full sets of Battleship in minimal time.Map information contains Water(0), Subs(1), Middle of a ship(6), Unknown(7), and the Aft(rear) of a ship. Ship going Up(2), Down(3), Left(4), and Right(5).Ships have no diagonal or UDLR adjacency. The best way in Seaman to deal with Midship segments is to determine where it can not go to determine an orientation.The map is ringed by zeros to make m a 12x12 array.Input: m,r,c; m 12x12 of map values, r(12,1) of row sums, c(1,12) of col sumsOutput: b; A binary 12x12 arrayScoring: Total Time (msec)Example:<pre class="language-matlab">r=[0 2 0 2 2 2 3 2 3 0 4 0]';
c=[0 4 0 3 1 3 1 4 0 1 3 0];
</pre><pre class="language-matlab">m b
000000000000 000000000000
077757777770 000011000000
077777777770 000000000000
077777777770 000100010000
077777777770 000100010000
077777777770 010000010000
077777777770 010000010010
027777777760 010000000010
077777777770 000101000010
077777777770 000000000000
077777477770 010001100100
000000000000 000000000000
</pre>Algorithm:<pre class="language-matlab">1) Initialize processing array based upon input matrix.
2) Implement a cycling check of driven array changes
3) Quick Test of Change every single Unknown serially
4) Evolve and check if complete solution created
5) Robustly recursively check all potential Battleships, Cruisers, Destroyers, Subs
</pre>

<http://www.conceptispuzzles.com/index.aspx?uri=puzzle/battleships Games Magazine Battleships> is a logic puzzle to find the Fleet given some map information and the number of Ship cells in every column and row. The fleet is made of a Battleship(4), two Cruisers(3), three Destroyers(2), and four Submarines(1). Thus the total filled cells is 20.

This Challenge is to complete three full sets of Battleship in minimal time.

Map information contains Water(0), Subs(1), Middle of a ship(6), Unknown(7), and the Aft(rear) of a ship. Ship going Up(2), Down(3), Left(4), and Right(5).

Ships have no diagonal or UDLR adjacency.  The best way in Seaman to deal with Midship segments is to determine where it can not go to determine an orientation.

The map is ringed by zeros to make m a 12x12 array.

*Input:* m,r,c;  m 12x12 of map values, r(12,1) of row sums, c(1,12) of col sums

*Output:* b; A binary 12x12 array

*Scoring:* Total Time (msec)

*Example:*

r=[0 2 0 2 2 2 3 2 3 0 4 0]';
  c=[0 4 0 3 1 3 1 4 0 1 3 0];
  
  m              b
  000000000000  000000000000
  077757777770  000011000000
  077777777770  000000000000
  077777777770  000100010000
  077777777770  000100010000
  077777777770  010000010000
  077777777770  010000010010
  027777777760  010000000010
  077777777770  000101000010
  077777777770  000000000000
  077777477770  010001100100
  000000000000  000000000000

*Algorithm:*

1) Initialize processing array based upon input matrix.
  2) Implement a cycling check of driven array changes
  3) Quick Test of Change every single Unknown serially
  4) Evolve and check if complete solution created
  5) Robustly recursively check all potential Battleships, Cruisers, Destroyers, Subs

Solve

Solution Stats

17 Solutions
3 Solvers

Last Solution submitted on Oct 01, 2020

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers3

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 2005. BattleShip - Seaman (1) thru Admiral(6) : CPU Time Scoring(msec)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers3

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 2005. BattleShip - Seaman (1) thru Admiral(6) : CPU Time Scoring(msec)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers3

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players