Skip to main content
12 events
when toggle format what by license comment
Aug 12, 2018 at 16:32 vote accept esQmo_
Oct 20, 2016 at 11:30 answer added mikosz timeline score: 1
Oct 20, 2016 at 7:31 answer added cocosushi timeline score: 2
Oct 16, 2016 at 0:01 history tweeted twitter.com/StackGameDev/status/787443271354159104
Oct 15, 2016 at 21:37 history edited ashes999 CC BY-SA 3.0
added 4 characters in body
Oct 15, 2016 at 17:21 comment added esQmo_ since many site are in English, it make it hard to me to understand. may be a human to human explanation could help me
Oct 15, 2016 at 17:19 comment added esQmo_ Hellp S.Mitchell, thanks for the reply. The problem is I don't know how to code it, how i could implement this algorithm to my java game? I can translate the code to make it clear to you?
Oct 15, 2016 at 16:55 comment added S. Mitchell I can't really make out your code, but the general approach I would make would be to iterate through your two dimenional array which stores where pieces are already placed. If a match is found, that is, it isn't empty, calculate the distance between your target position and the non-empty position using the indices of the array. Store this number and then compare all the number you have or just keep the highest one. If this doesn't help you, please add a comment to say what you want.
Oct 15, 2016 at 16:42 history edited esQmo_ CC BY-SA 3.0
added 81 characters in body
Oct 15, 2016 at 4:34 history edited esQmo_ CC BY-SA 3.0
added 9 characters in body
Oct 15, 2016 at 4:29 review First posts
Oct 15, 2016 at 5:13
Oct 15, 2016 at 4:25 history asked esQmo_ CC BY-SA 3.0