The latest articles on DEV Community by Bandaged Group (@bandagedg). https://dev.to/bandagedg https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F519045%2F7e8fbda2-f47b-4de1-9550-c23411d95a5e.jpg https://dev.to/bandagedg en Bandaged Group Sun, 22 Nov 2020 23:03:25 +0000 https://dev.to/bandagedg/marching-ants-puzzle-1boe https://dev.to/bandagedg/marching-ants-puzzle-1boe <p>Suppose there is an ant at each vertex of a triangle (cube, regular tetrahedron / octahedron / dodecahedron / icosahedron / general planar graph / any graph).</p> <p>Suddenly each ant randomly (with equal probability) picks a neighboring edge and crawls along it to the next vertex. What is the probability that no two ants collide, neither on a vertex, nor en route on an edge?</p> <p><strong>Example solution for triangle.</strong><br> Each ant can move either Left, or Right. That gives 8 options: LLL, LLR, LRL, LRR, RLL, RLR, RRL, RRR. However, only in LLL and RRR no ants collide. Two options out of eight give probability 2/8 = 1/4.</p> <p>Give your numeric solutions for the mentioned polyhedra or an algorithm for a sufficiently general case!</p> challenge codingpuzzle math algorithms