Talk:Marching squares: Difference between revisions

From Rosetta Code
Content added Content deleted
(Oops -- use East is right, West is left convention)
(probably should show the other starting bitmap here, since the task page might change significantly in the future)
Line 25: Line 25:
This transformation lacks symmetry which makes it suspect. But currently there's nothing in the task description to help us understand this issue.
This transformation lacks symmetry which makes it suspect. But currently there's nothing in the task description to help us understand this issue.


In contrast, the Wren and Phix solutions identify a path with length 11 of 10 coordinates which would probably correspond to these positions:
In contrast, the Wren and Phix solutions start from this bitmap

<pre>0 0 0 0 0
0 0 0 0 0
0 0 1 1 0
0 0 1 1 0
0 0 0 1 0
0 0 0 0 0</pre>

and identify a path with length 11 composed of 10 unique coordinates which would probably correspond to these positions:


<pre>0 0 0 0 0
<pre>0 0 0 0 0

Revision as of 01:40, 30 June 2022

Task needs work

Currently, the task description does not allow us to determine whether an implementation is correct.

The referenced wiki pages represent an image transformation, but currently no tasks here generate images (and this site is poorly equipped to represent images).

Instead, some of the tasks currently represent a transformation from a bitmap to a sequence of non-unique coordinates, but it's not clear that those coordinates represent the marching squares image transformation.

Specifically, we see:

0 0 0 0 0
0 0 0 0 0
0 0 1 1 0
0 0 1 1 0
0 0 0 0 0

being transformed into a sequence of 11 coordinates pairs which correspond to 9 distinct coordinates arranged like this:

0 0 0 0 0
0 0 1 1 0
0 1 0 0 1
1 0 0 0 1
0 1 1 1 0

This transformation lacks symmetry which makes it suspect. But currently there's nothing in the task description to help us understand this issue.

In contrast, the Wren and Phix solutions start from this bitmap

0 0 0 0 0
0 0 0 0 0
0 0 1 1 0
0 0 1 1 0
0 0 0 1 0
0 0 0 0 0

and identify a path with length 11 composed of 10 unique coordinates which would probably correspond to these positions:

0 0 0 0 0
0 0 0 0 0
0 0 1 1 1
0 0 1 0 1
0 0 1 1 1
0 0 0 1 1

Again, this lacks symmetry. But this result is not comparable to the other result because the starting bitmap was different (and also was not symmetric). This one, at least, seems to correspond more closely to the shape of the initial bitmap.

Possibly all of these results are correct. Possibly not. Currently the task is too ambiguous. --Rdm (talk) 01:34, 30 June 2022 (UTC)