Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
25 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2020 at 2:43 | comment | added | user202729 | Note that the actual implementation is very simple, as explained in chat. | |
| Jul 14, 2020 at 15:24 | comment | added | Dingus | Nicely reworked. But what is n in roll "1" is at P(1,n,0)? | |
| Jul 14, 2020 at 14:29 | history | edited | simonalexander2005 | CC BY-SA 4.0 | added 55 characters in body |
| Jun 17, 2020 at 9:03 | history | edited | CommunityBot | Commonmark migration | |
| Nov 22, 2019 at 15:03 | history | edited | simonalexander2005 | CC BY-SA 4.0 | added 556 characters in body |
| Nov 22, 2019 at 14:46 | history | edited | simonalexander2005 | CC BY-SA 4.0 | deleted 243 characters in body |
| Nov 22, 2019 at 14:40 | comment | added | simonalexander2005 | @KevinCruijssen Thanks, that's helpful. | |
| Nov 22, 2019 at 14:39 | comment | added | Kevin Cruijssen | It would also need some info about the size of the sphere, and what to do when the coordinate is exactly in the center between two or three poles. | |
| Nov 22, 2019 at 14:36 | comment | added | Kevin Cruijssen | Although I don't think the current challenge is bad, it's usually best to not have multiple challenges into one nor multiple outputs (since some languages aren't able to output more than once very easily). The two challenges are: 1. Generate a random coordinate on a sphere (in whichever coordinate system you want); 2. Given a (random) coordinate on a sphere, output the dice-value closest to it. No. 1 already is a challenge, so I agree it might be better to rewrite it to challenge No. 2. I do like the general idea though, so +1 from me. | |
| Nov 22, 2019 at 13:33 | comment | added | simonalexander2005 | I want it to be a good challenge on this theme, whatever that would look like :) | |
| Nov 22, 2019 at 13:31 | comment | added | AlienAtSystem | If you want the challenge to be about finding the points it's closest to, yes. | |
| Nov 22, 2019 at 13:27 | comment | added | simonalexander2005 | Would it be better for the point on the sphere to be the input, then? | |
| Nov 22, 2019 at 13:24 | comment | added | simonalexander2005 | @AlienAtSystem thanks for the feedback, I'd never heard of a Voronoi cell before. What I'm asking, then, is "generate a random point on a sphere and say which Voronoi cell that point is in". Can you explain why that doesn't work? Note that I'm asking for both the point and the cell to be output, not just the cell - otherwise I agree, given the "no unobservable requirements" rule it would be possible to just generate a random number and pretend you'd done it properly (although that would be against the spirit of it) | |
| Nov 22, 2019 at 13:21 | comment | added | AlienAtSystem | It's clearer that my point still stands. Look, "Make Voronoi cells on sphere" and "Generate uniformly random points on sphere" are both good challenges. But when put together like that, they annihilate each other and give you an extremely quick shortcut right from Input (None) to output (a die roll) that doesn't require calculation of either part. | |
| Nov 22, 2019 at 13:15 | comment | added | simonalexander2005 | @AlienAtSystem I've edited to try and make it clearer what I'm looking for. Is it clearer now? | |
| Nov 22, 2019 at 13:14 | history | edited | simonalexander2005 | CC BY-SA 4.0 | added 98 characters in body |
| Nov 22, 2019 at 13:09 | comment | added | AlienAtSystem | That's not the challenge as posted. Right now, it's "Takes no input, returns the number the (internally generated) random point is closest to" which is, under the consensus of no unobservable requirements simply equal to "Takes no input, returns uniform random value from 1-6". If you want the challenge to be "Input is point on sphere, output is number it's closest to", then write that. | |
| Nov 22, 2019 at 13:04 | comment | added | simonalexander2005 | @AlienAtSystem yes, all outcomes are equally likely; but the challenge is determining which number any given point on the face of the sphere is closest to | |
| Nov 22, 2019 at 12:33 | comment | added | AlienAtSystem | This will be exactly equivalent to a uniform distribution over 6 values, just based on the symmetry of the situation. | |
| Nov 22, 2019 at 11:20 | history | edited | simonalexander2005 | CC BY-SA 4.0 | added 73 characters in body |
| Nov 22, 2019 at 11:12 | history | edited | simonalexander2005 | CC BY-SA 4.0 | added 38 characters in body |
| Nov 22, 2019 at 11:11 | comment | added | simonalexander2005 | yeah, so generate a random point on the sphere, then find the nearest "face" - i.e. the nearest of the 6 points (top, bottom, 4 points on opposite sides around middle) | |
| Nov 22, 2019 at 9:57 | comment | added | flawr | I'm not sure I understand: You want us to generate a random point on a sphere and output the face of the die it corresponds to? | |
| Nov 22, 2019 at 9:40 | comment | added | simonalexander2005 | Does anyone know the maths for this? Feel free to edit it in! | |
| Nov 22, 2019 at 9:39 | history | answered | simonalexander2005 | CC BY-SA 4.0 |