Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
T
trs
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Taddeüs Kroes
trs
Commits
ecf5d466
Commit
ecf5d466
authored
May 05, 2012
by
Taddeus Kroes
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Cleared up some variable names.
parent
54783d37
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
5 deletions
+5
-5
TODO
TODO
+5
-5
No files found.
TODO
View file @
ecf5d466
...
@@ -86,24 +86,24 @@ Division of 0 by 1 reduces to 0.
...
@@ -86,24 +86,24 @@ Division of 0 by 1 reduces to 0.
To generate a hint for expression list A, ..., B:
To generate a hint for expression list A, ..., B:
1. Create a possibility tree for A.
1. Create a possibility tree for A.
2. Validate all expressions up to B:
2. Validate all expressions up to B:
set
root node
= A
set
ROOT
= A
for each expression C in <A, B] do:
for each expression C in <A, B] do:
if final answer of C is not equal to final answer of A:
if final answer of C is not equal to final answer of A:
validation failes at c
validation failes at c
find C in the possibility tree, traversing from
the root node
find C in the possibility tree, traversing from
ROOT
if not found:
if not found:
validation continues, but generate an efficiency warning at C
validation continues, but generate an efficiency warning at C
# FIXME: validation fails at C?
# FIXME: validation fails at C?
set
root node
= C
set
ROOT
= C
3. Generate a hint:
3. Generate a hint:
#
root node
should now be equal to B, so lookup of B is unnecessary
#
ROOT
should now be equal to B, so lookup of B is unnecessary
set N = empty dictionary
set N = empty dictionary
for each possibility of
the current root
P node do:
for each possibility of
ROOT
P node do:
evaluate P(B) until the final expression of A is reached
evaluate P(B) until the final expression of A is reached
set N[P] = the number of explicit possibilities that have been applied in the evaluation
set N[P] = the number of explicit possibilities that have been applied in the evaluation
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment