A great Python tutorial can be found here on Python official website:
https://docs.python.org/3/tutorial/index.html
You can either use an online IDE such as https://repl.it/ or anything else such as PyCharm. But the point is to get you started asap and move quickly.
On 9/23/2018, some of you finished the first ACSL problem - ACSL_timesheets in Python.
Please reply to this thread with your solution so I know your progress. Thanks!
For checkers, you might want to think along the line what data structure is the easiest to decide if a "jump" is available. The goal is to count the potential jumps, not to simulate the checker board. You only need to evaluate one move: say (1,5) is your position, the only possible jump is your opponent occupies (2,4) or (2,6). So you only need to check if (2,4) or (2,6) is occupied. If yes, then check (4,2) and (4,4) if (2,4) is occupied; or (4,6) and (4,8) if (2,6) is occupied. Running through all the number pairs and update a counter accordingly would give you the result.