Assessment of test case coverage for plan_moves()
A machine test that automatically assesses the completeness of a list
of provided test cases for the plan_moves() method from
the Solitaire Mancala practice activity. Your input file should
contain a single Python definition:
- A list
TEST_CASES containing at most 10 test
cases for the method plan_moves().
- Each test case in this list should be a list of integers of length
at least 1 and at most 10, whose entries are integers in the range 0
to 10 (inclusive). The first integer in this list must be a 0.
Each test case corresponds to a configuration of the Mancala board
(initialized using the set_board method) prior to a call
to the method plan_moves(). You do not need to provide
the corresponding output. We will compute it from our reference
implementation. Note that submissions to OwlTest that do not conform
to this format are rejected.
Owltest will assess the completeness of the test cases in
TEST_CASES using a hidden suite of incorrect
implementations of plan_moves() that we have
compiled. Specifically, OwlTest will run each of these incorrect
implementations on the test cases in TEST_CASES. If an
incorrect implementation returns a correct answer on all tests in
TEST_CASES, OwlTest will record that the program
(incorrectly) passed the provided tests. If an incorrect
implementation returns an incorrect answer on at least one of the test
in TEST_CASES, OwlTest will record that the
implementation (correctly) failed the provided tests.
After performing these checks, OwlTest returns a code that you should
enter as the answer to Question 10 on Homework 4. The grade on
Coursera that you receive for the entered code will be determined by
the number of incorrect implementations that failed the provided
tests. To receive credit for this problem, your goal should be to
construct a list of tests that maximize the number of programs that
fail your provided tests.
Pylint style checking is not enabled for this activity. Score will
not be reported here.
|
