×

# Optimizations for SEAND2 (january challenge 14)

 2 Anyone please explain SEAND2's solution used by the toppers. Time constraint Simulated Annealing fetched me around 74% . I am wondering what the toppers have used ? I know they have many 2D tables tables and their own random permutation generators in their solutions, but don't have any idea of their approaches. I guess my simulated annealing solution was not perfect but i would like to know other peoples approaches. thanks asked 13 Jan '15, 16:05 4★dddlll 31●1●3 accept rate: 0% 0★admin ♦♦ 19.8k●350●498●541 1 You have the wrong tag, it should be jan15, not jan14! That might be why no one has answered. :/ (14 Jan '15, 01:01) thanks , luc4sdreyer for pointing out this . (14 Jan '15, 12:11) dddlll4★

 0 The problem with simulated annealing is: how do you know that smaller search spaces will optimise the final answer? I had thought of some evolutionary algorithms too but no fitness function came to mind which is close to optimal. One of the possible approaches was to try and reach a specific number, but I discarded that because it didn't seem promising. You can have a look at my blog on this problem. Pretty much brute force all the way, but I tried to optimise as much as possible. http://gauravsen.blog.com/2015/01/14/hello-world/ Happy Coding answered 14 Jan '15, 13:42 4★gkcs 2.6k●1●11●28 accept rate: 9%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×1,424
×858
×235
×18

question asked: 13 Jan '15, 16:05

question was seen: 1,338 times

last updated: 14 Jan '15, 14:37