Gameplay Telemetry for a Block-based Programming Game
Principal Investigator(s): View help for Principal Investigator(s) Gregory Chung, University of California-Los Angeles
Version: View help for Version V1
| Name | File Type | Size | Last Modified |
|---|---|---|---|
|
|
application/pdf | 639 KB | 10/28/2023 03:01:PM |
Login to generate citation for this file.
To view the citation for the overall project, see http://doi.org/10.3886/E195666V1.
File Description
Summary:
View help for Summary
When evaluating performance-based assessments where the user is tasked to solve problems with clearly specified goals, then the expected optimal event sequence can be defined for each problem situation. To computationally evaluate user performance, one can calculate the distance to optimal performance, which measures how close a user’s event sequence is as compared to the optimal event sequence in any given situation. Here, we will describe the algorithm and software code used to calculate this distance for a block-based coding game. The goal of this report is to enable the reader to program her own code for problems and tasks, where such optimal performance is defined.
Related Publications
Published Versions
Report a Problem
Found a serious problem with the data, such as disclosure risk or copyrighted content? Let us know.
This material is distributed exactly as it arrived from the data depositor. ICPSR has not checked or processed this material. Users should consult the investigator(s) if further information is desired.