Checkers Capture

Checkers Capture


Imagine a n-by-n chessboard, where your single checker currently stands at position (x, y) and there is pieces - a list that contains the positions of the opponent’s pawns.

Your checker may capture a piece only one step in the four diagonal directions assuming that the square behind the opponent piece in that diagonal direction is vacant. Your checker can then capture that piece by jumping over it into the vacant square, immediately removing that captured piece from the board. The chain of captures continues from the new square, potentially capturing all the pieces in one swoop.

Your function should return the maximum number of pieces that your checker could potentially capture in a single move.

Input: Three arguments: size (int), coordinates (tuple of two integers (int)) and a sequence of opponent's pieces (list of coordinates).

Output: Integer (int).


assert max_checkers_capture(5, (0, 2), [(1, 1), (3, 1), (1, 3)]) == 2
assert max_checkers_capture(7, (0, 0), [(1, 1), (1, 3), (3, 3), (2, 4), (1, 5)]) == 3
assert (
        (5, 3),
            (6, 2),
            (2, 4),
            (2, 2),
            (0, 4),
            (5, 5),
            (1, 5),
            (3, 7),
            (6, 4),
            (5, 7),
            (0, 6),
            (0, 2),
            (1, 7),
            (2, 6),
            (6, 0),
            (6, 6),
            (3, 5),
    == 1
Need a small hint? Click on

The maximum number of pieces that can be captured in a single move is best computed with a method that locally loops through the four diagonal directions from the current position of the king. For each such direction that contains an opponent piece with a vacant space behind it, remove that opponent piece from the board, and recursively compute the number of pieces that can be captured from the vacant square that your king jumps into. Once that recursive call has returned, restore the captured piece on the board, and continue looping to the next diagonal direction. The number of captures of whichever direction gives the best result from that square is returned as the answer.

The mission was taken from Python CCPS 109. It is taught for Ryerson Chang School of Continuing Education by Ilkka Kokkarinen

Invalid hot key. Each hot key should be unique and valid
Hot keys:
CheckiO Extensions

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

pip3 install checkio_client

Configure your tool

checkio --domain=py config --key=

Sync solutions into your local folder

checkio sync

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)

checkio serv -d

Alternatevly, you can install Chrome extension or FF addon

checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium

Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.

Pair Programming (Beta-version)

Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!

Waiting for Pair Programming to start...

You are trying to join a pair programming session that has not started yet.

Please wait for the session creator to join.

Waiting for Pair Programming to reconnect...

It looks like the creator of the pair programming session closed the editor window.

It might happen accidentally, so that you can wait for reconnection.

<< <
> >>
exec show

Whats Next?

Free accounts will see Best CheckiO solutions with some delay.
Best Solutions will be opened in a moment
Become Awesome and Don't wait
The next stage is ""
Will be activated in
View More Solutions Random Review Solutions Go to the next mission