Gamification of Problem Solving Process Based on Logical Rules
One of the main elements of the modern educational process in the field of IT is the solution of logical-combinatorial problems. When solving such problems, learners need to build a new solution based on the set of basic operations studied before being combined according to certain rules. To consolidate these skills, leaner need to solve a reasonable number of problems that leads to need of verification of a huge number of solutions.
Many systems allow us to automate the verification of solutions. In most cases, these systems check pure answer only, but not the progress of the solution itself. Such a method of verification does not exclude the possibility of obtaining the correct answer and the credited task with an incorrect or inconsistent solution.
We propose a method for verifying the solution of problems, based on search of valid transformations, or stepwise refinements, similar to search for proof in logical calculi. This means that, the system at each step effectively sorts out all possible transformations, trying to find one that the learner applied. In this case, the system not only can find an error in the solution, but also indicate the source of this error, which is wrong transition between steps.
In addition to automatically verifying the solutions, this approach allows us to generate tasks that require the application of specific rules. Also the application of the rules can be interpreted as “moves” in the intellectual game. Then the solution of the problem turns into a game process, and the correct solution corresponds to a sequence of steps leading to the victory in the game.
The proposed approach was tested on students of the junior courses and showed good results. Namely, in the conducted experiments the efficiency of the teacher’s work when checking solutions increased more than 4 times.
KeywordsEducation Problem solution Learning automation Logical rules Stepwise refinement
- 1.Vene, V.: Comparing different styles of automated feedback for programming exercises. In: Proceedings of the 17th Koli Calling International Conference on Computing Education Research, Koli Calling 2017, pp. 183–194 (2017). https://doi.org/10.1145/3141880.3141909
- 2.Tirronen, M., Tirronen, V.: A framework for evaluating student interaction with automatically assessed exercises. In: Proceedings of the 16th Koli Calling International Conference on Computing Education Research, Koli Calling 2016, pp. 180–181 (2016). https://doi.org/10.1145/2999541.2999568
- 3.Coursera Homepage. https://ru.coursera.org/. Accessed 19 May 2017
- 4.Stepik Homepage. https://welcome.stepik.org/en. Accessed 19 May 2017
- 5.WeBWorK Homepage. https://webwork.elearning.ubc.ca/webwork2/. Accessed 19 May 2017
- 6.Moodle Homepage. https://moodle.org/. Accessed 19 May 2017
- 7.Rogers, H.: The Theory of Recursive Functions and Effective Computability. MIT Press (1987). ISBN: 0-262-68052-1; ISBN: 0-07-053522-1Google Scholar
- 10.Stepik Code Lesson. https://stepik.org/lesson/9173/step/1?course=Epic-Guide-to-Stepik&unit=1718. Accessed 19 May 2017
- 11.NeuroRehabLab Homepage. https://neurorehabilitation.m-iti.org/TaskGenerator/. Accessed 19 May 2017