CONNECT-THE-NODES
Techniques for teaching geometric proof problems are described. According to one approach, the geometric proof application displays a geometric proof problem and a set of connectable nodes in an initial arrangement. A user then rearranges the set of connectable nodes and connects them using one-way connections to generate a solution. The geometric proof problem is solved if the user-generated solution indicates the correct logical ordering of the set of connectable nodes as determined by the geometric proof application.
1 . A computer-implemented method comprising:
a geometric proof application, executing on a computing device, displaying a set of connectable nodes arranged in an initial display arrangement;
wherein the initial display arrangement is determined by the geometric proof application;
wherein, within the initial display arrangement, the geometric proof application indicates a statement for each connectable node in the set of connectable nodes;
wherein the statement of each connectable node in the set of connectable nodes indicates at least one of:
a given in a set of givens for a geometric proof problem;
an intermediate step of the geometric proof problem; or
a conclusion step of the geometric proof problem;
wherein the initial display arrangement does not match a correct arrangement for the geometric proof problem;
the geometric proof application providing a mechanism that enables a user to specify:
a new arrangement of the connectable nodes; and
one-way connections between the connectable nodes; and
the geometric proof application determining whether the new arrangement, including the one-way connections specified by the user, matches the correct arrangement for the geometric proof problem.
2 . The computer-implemented method of claim 1 , wherein the geometric proof problem comprises the set of givens, a final proof statement, and a set of instructions.
3 . The computer-implemented method of claim 2 , wherein the geometric proof application displays the geometric proof problem and the initial display arrangement of the set of connectable nodes in at least one content pane.
4 . The computer-implemented method of claim 1 , wherein the display arrangement is randomly generated.
5 . The computer-implemented method of claim 1 , wherein each node indicating an intermediate step displays a statement and a reason for said statement.
6 . The computer-implemented method of claim 1 , wherein the mechanism enables the user to drag at least a subset of the connectable nodes around within a workspace.
7 . The computer-implemented method of claim 1 , wherein the mechanism enables the user to create a one-way connection between a first connectable node and a second connectable node by indicating a connection area on the first connectable node and a connection area on the second connectable node.
8 . The computer-implemented method of claim 7 , wherein the mechanism further comprises:
in response to receiving input that indicates the connection area on the first connectable node and the connection area on the second connectable node, causing a unidirectional line to be displayed from the connection area on the first connectable node to the connection area on the second connectable node.
9 . The computer-implemented method of claim 1 , wherein the geometric proof application determines whether the new arrangement, including the one-way connections specified by the user, matches the correct arrangement for the geometric proof problem after each of the one-way connections is specified by the user.
10 . The computer-implemented method of claim 1 , further comprising alerting the user of an outcome of said determination.
11 . The computer-implemented method of claim 9 , further comprising alerting the user of an outcome of said determination.
12 . The computer-implemented method of claim 1 , wherein the set of connectable nodes includes at least one decoy node that is not part of the correct arrangement.
13 . A non-transitory computer-readable storage medium storing one or more sequences of instructions, which instructions, when executed by one or more processors, cause the one or more processors to perform steps comprising:
a geometric proof application displaying, on a computing device, a set of connectable nodes arranged in an initial display arrangement;
wherein the initial display arrangement is determined by the geometric proof application;
wherein, within the initial display arrangement, the geometric proof application indicates a statement for each connectable node in the set of connectable nodes;
wherein the statement of each connectable node in the set of connectable nodes indicates at least one of:
a given in a set of givens for a geometric proof problem;
an intermediate step of the geometric proof problem; or
a conclusion step of the geometric proof problem;
wherein the initial display arrangement does not match a correct arrangement for the geometric proof problem;
the geometric proof application providing a mechanism that enables a user to specify:
a new arrangement of the connectable nodes; and
one-way connections between the connectable nodes; and
the geometric proof application determining whether the new arrangement, including the one-way connections specified by the user, matches the correct arrangement for the geometric proof problem.
14 . The non-transitory computer-readable storage medium of claim 13 , wherein the geometric proof problem comprises a set of givens, a final proof statement, and a set of instructions.
15 . The non-transitory computer-readable storage medium of claim 13 , wherein the geometric proof application displays the geometric proof problem and the initial display arrangement of the set of connectable nodes in at least one content pane.
16 . The non-transitory computer-readable storage medium of claim 13 , wherein the display arrangement is randomly generated.
17 . The non-transitory computer-readable storage medium of claim 13 , wherein the node for each intermediate step displays a statement and a reason for said statement.
18 . The non-transitory computer-readable storage medium of claim 13 , wherein the mechanism enables the user to drag at least a subset of the connectable nodes around within a workspace.
19 . The non-transitory computer-readable storage medium of claim 13 , wherein the mechanism enables the user to create a one-way connection between a first connectable node and a second connectable node by indicating a connection area on the first connectable node and a connection area on the second connectable node.
20 . The non-transitory computer-readable storage medium of claim 19 , wherein the mechanism further comprises:
in response to receiving input that indicates the connection area on the first connectable node and the connection area on the second connectable node, causing a unidirectional line to be displayed from the connection area on the first connectable node to the connection area on the second connectable node.
21 . The non-transitory computer-readable storage medium of claim 13 , wherein the geometric proof application determines whether the new arrangement, including the one-way connections specified by the user, matches the correct arrangement for the geometric proof problem after each of the one-way connections is specified by the user.
22 . The non-transitory computer-readable storage medium of claim 13 , further comprising alerting the user of an outcome of said determination.
23 . The non-transitory computer-readable storage medium of claim 21 , further comprising alerting the user of an outcome of said determination.
24 . The non-transitory computer-readable medium of claim 13 , wherein the set of connectable nodes includes at least one decoy node that is not part of the correct arrangement.