Research

At the moment, I am creating my software diagrams, mainly the software flowcharts. I am also researching Checker's itself. I am finding strategies to win the game easily and be able to not lose at the same time. I have found that there are over 500 billion billion (or 500,000,000,000,000,000,000) possible positions of the pieces on the board. Obviously there is no way to find every possible position in time and the size of the program would become far too large. I realized I do not need to create a perfect algorithm that cannot lose for the computer hard difficulty but I need to create an algorithm that is hard to beat but sill possible otherwise it would be pointless for a user to even attempt to win.