You have two options.
Copy the string from one variable to the other, using strcpy.
The other option is to pass in pointers to the char arrays (pointers to pointers) and swap around what they point to.
i.e.
void swap(char **a, char **b)
{
char *t;
t = a*;
a* = b*;
b* = t;
}I...
Nope, it doesn't class you as anything if you blog, but given the content of that post, it classes you as a hypocrite. :)
I blog because i have a few friends who aren't online much (or when i am), and who live abroad or in another part of the country who want to know what i'm up to.
Hungary, but more specifically Budapest. Been there twice, staying with a friend.
So much better architecture (SP?) than the UK, plus all the women are VERY hot, and not stuck up, like *most* fit woment in the UK are.
Plus everything 's amazingly cheap, e.g. 50p for a pint!!
They would work better on a 64-bit CPU because of representation (for chess you need 64 bits per bitboard, one bit for each square). They can be used by any CPU though.
If you wern't planning on using them i strongly recommend researching the topic since it's agreed to be the best method of...
Sounds good, i'd be interested to see how it turns out. One of the major problems you'll face is the fact that the tree is going to be very, very wide (lots of moves from a given position). Think very hard about your use of bitboards before you start. :)
Here's some good sites...
Yeah, i'm aware of many of the optimizations, i've implemented a checkers/draughts opponent myself. Even with these optimizations, you'd need a powerfull computer, or a VERY large database/cache to get a complete tree.
I knew people eventually would,
contribute lymerics. They should!
'Course that brings pressure,
competition to test 'ya,
But hopefully this 'll turn out good.
There was a young man from Vancouver,
Who fell in love with a Hoover,
With cleaning he's zealous,
and his wife got jelous,
So he quickly used it to soothe 'er. ;)