Search the web
Sign In
New User? Sign Up
abalone_prog · Abalone
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Want your group to be featured on the Yahoo! Groups website? Add a group photo to Flickr.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
Re: Pattern matching   Message List  
Reply | Forward Message #85 of 96 |
Re: [abalone_prog] Pattern matching

I looked at the LaTeX formulas, the problem is that i'm not using the manhattan
distance as such. i.e. based on independant x and y when calculating.

I'm using arithmetic distance defined as follows

d(xi,yi,xc,yc) =

if (xi-xc)(yi-yc)>0
return max (xi-xc,yi-yc)
else
return abs(xi-xc) + abs(yi-yc)

based on a "c" point, i need to sum for all (xi,yi)

additionnaly, i'm computing integers only, so floor(x) has to be ...
reconsidered.

this doesnt prevent me from finding a solution :) the sum of all d(xi,yi,xc,yc)
can be written s the sum of sums depending on the cases. but it looks
complicated.

except for the calculation of c, i just disclosed the center of mass
calculations of MLA lol.

david

Selon david.malek@...:

>
> > In MLA, in line move generation is performed as follows
> >> Why add? Why not simply overwrite? It ought to be faster.
> True. But adding makes undo a substraction of the same numbers. Also it
> allowed
> me to define ranges for the move number, due to unchanged fields (0 values
> can
> be added to anything). It's probably the reason why it's still performed this
> way in MLA lol.
>
> > But i'm also searching for a faster move generation
> > I have previously posted a paperon how to do incremental computation of
> compactness.
> I found this paper long time ago lol, maybe i needed to understand it (gosh i
> dont know latex lol i'm a windows guy). I finally converted it to PDF, lol,
> you
> are right again. I'll most probably enhance the speed significantly
> (evaluation
> is about 30% of the time i use).
>
> > With respect to bitboards, I have not found a convincing case for them.
> oh yes, finding patterns and handling rotation is documented by the author of
> crafty too. your C is interesting. But trying to use the ONLY bitboards for
> center of mass computation, move generation, domove/undomove might be hard.
> Hmm
> this would even impact my search ... hmm for MLA 4.0 lol.
>
> >Seriously, though - I would really love to hear more about useful patterns.
> Oh yeah, i'll keep you posted, once i've understood why MLA 3.0 wins lol. As
> it
> questions connectivity, connectivity means radius-1 patterns.
>
> So well, i'm all set, i have good leads to increase speed, and probably good
> leads to increase strength :)
>
> What else would i need? Hmm maybe a good beer ;)
>
> David.
>
>





Tue May 22, 2007 5:00 pm

mogwaifrance
Offline Offline
Send Email Send Email

Forward
Message #85 of 96 |
Expand Messages Author Sort by Date

Thanx for all this :) I still dont understand why my new version of the engine beats the previous one lol. Each time I slightly change my amendments to the...
david.malek@...
mogwaifrance
Offline Send Email
May 22, 2007
8:20 am

... True. But adding makes undo a substraction of the same numbers. Also it allowed me to define ranges for the move number, due to unchanged fields (0 values...
david.malek@...
mogwaifrance
Offline Send Email
May 22, 2007
2:28 pm

I looked at the LaTeX formulas, the problem is that i'm not using the manhattan distance as such. i.e. based on independant x and y when calculating. I'm using...
david.malek@...
mogwaifrance
Offline Send Email
May 22, 2007
5:02 pm

... the manhattan ... Your formula for distance is in fact the Manhattan distance. Charles Fu had it figured out in 1994. Read this link: ...
Peer Sommerlund
peer_sommerlund
Offline Send Email
May 29, 2007
9:29 am
Advanced

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help