Is it possible to handle solutions larger than 8x8 square ?

[Mouradif]

Yo !

I just found your code, I am currently working on this assignment and I'm doing it with bitwise comparisons too. The solution map is an unsigned long long (64bit = 8x8 bits). I was wondering : is it possible to handle larger squares ? For example if we could use an array of 4 unsigned long longs as a map.

Thanks

[multisme]

Hellow .!

yeah It is possible:
when you have to set a piece which overlaps two int, the trick is to do
right shit on the first one and a left shit on the second one.
You can also use 128bits integers (uint128_t type) and only use an array of
two int.
You're welcome.

ps: When your done with the project, i would love if you could keep me
updated on the comparative performance of your algo and ours on your device.

2016-02-15 13:58 GMT+01:00 Mouradif notifications@github.com:

Yo !

I just found your code, I am currently working on this assignment and I'm
doing it with bitwise comparisons too. The solution map is an unsigned long
long (64bit = 8x8 bits). I was wondering : is it possible to handle larger
squares ? For example if we could use an array of 4 unsigned long longs as
a map.

Thanks

—
Reply to this email directly or view it on GitHub
#4.

[Mouradif]

Thank you for your answer !

I didn't know about uint128_t. I am not sure if I am allowed to use it though. If it turns out I can, should I make a 11x11 square out of 121 bits and ignore the 7 unused bits ? I was more thinking about using 4 long ints and make a perfect 16x16 square.