Anonymous user
Talk:Constrained random points on a circle: Difference between revisions
Talk:Constrained random points on a circle (view source)
Revision as of 11:00, 3 September 2010
, 13 years ago→How to check the code: new section
m (→Not 100 points: clarified which output I've meant) |
(→How to check the code: new section) |
||
Line 1:
== Not 100 points ==
There are only 89 points in the circle shown in the verilog example output. This is no surprise, because AFAICS the algorithm doesn't make sure that the same point isn't chosen twice. Now given that it's the first example, I guess it's what was meant by the task description, but then the task description probably should be changed to reflect the fact that less points are OK. --[[User:Ce|Ce]] 10:55, 3 September 2010 (UTC)
== How to check the code ==
If you increase the number of points produced to 10k, you should get output rather like this (generated with Tcl version; your version may differ). This lets you check that the spread of points produces the expected annulus. –[[User:Dkf|Donal Fellows]] 11:00, 3 September 2010 (UTC)
<pre>
X
XXXXXXXXXXX
XXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXX XXXXXXXX
XXXXXXX XXXXXXX
XXXXXX XXXXXX
XXXXXX XXXXXX
XXXXXX XXXXXX
XXXXX XXXXX
XXXXX XXXXX
XXXXX XXXXX
XXXXX XXXXX
XXXXXX XXXXXX
XXXXX XXXXX
XXXXX XXXXX
XXXXX XXXXX
XXXXX XXXXX
XXXXXX XXXXXX
XXXXXX XXXXXX
XXXXXX XXXXXX
XXXXXXX XXXXXXX
XXXXXXXX XXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXX
XXXXXXXXXXX
X
</pre>
| |||