Author: Charles L. Williams
Date: 08:11:04 04/10/99
Go up one level in this thread
On April 10, 1999 at 03:53:47, TEERAPONG TOVIRAT wrote: > >I'm interested in checker programming. I've just learned chess programing by >reading some chess source codes. > My questions are : >1. Can we use array of 32 squares in stead of 64 squares? If so .How about unit >move? It's >different from line to line. Or array of 50 squares (I rotated board 45 degrees >. > 0 (1) (2) (3) > (4) (5) 6 7 8 (9) (10) > (11) 12 13 14 15 16 (17) > .......and so on to 49 > >The bracket squares are omitted. I used only 32 non bracket squares to play. >In this way , I found it's easier to handle unit move ie. +7,+1,-1,-7. and less >squares than 64. >2.About captured pieces. In checker we can capture more than one pieces in one >move. >How to store it and take back in search function. Use a stack to store captured pieces. Considering captures are consecutive, pop them off and put them back on the board when you undo the move. For deep searches, there might be times when the program generates some captures, moves, then more captures. Just leave some of the stack entries blank for the moves. >3.Any ideas about evaluation_position function : no king, no center,no >(gross)different in pieces >sometimes higher position is not good!! >4.Which is fastest for a compiler to achieve an integer : bit operator, >arithmatioc operator(+,-) >or find an integer in an array? > >Any ideas, any suggestions will help me so much. > >Thanks in advance. > T.Tovirat
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.