Relative-Hards Solved Complex, a log measure of using complex code on personally difficult levels, predicts time spent on an unsolvable challenge task¶
Claim · All claims
Evidence · 1 study · associationalr1·q2·i3large
Currency · newest study 2016 · not yet checked against its sources · not reviewed by a person
Subclaims¶
Reading the evidence codes
q is the design tier, i the impact, n the sample, and the kind with its r
the rigour judged within that kind: what each code means.
This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.
q2 i3 Relative-Hards Solved Complex correlated with challenge time (r = 0.67, p = .003), survived Benjamini-Hochberg correction and pretest control (partial r = 0.64, p < .01), and explained 44.7% unique variance in challenge time. → Malkiewich 2016
Evidence¶
Malkiewich 2016¶
Malkiewich, L. J., Lee, A., Slater, S., & Chase, C. C. (2016). Tenacious Assessments: Using In-Game Behaviors to Measure Student Persistence and Challenge Navigation. https://eric.ed.gov/?q=Tenacious+Assessments+Using+In-Game+Behaviors
q2 · i3 · associational · r1
Step-wise regression with challenge time (minutes on an unsolvable task) as the classic persistence criterion; pretest did not explain challenge time (p = .87). Relative-Hards Solved Complex "explained 44.7% more unique variance in Challenge time than pretest alone". Raw correlation was r = 0.67, p = .003.
"Relative-Hards Solved Complex, when added to the model, ultimately explained 44.7% more unique variance in Challenge time than pretest alone, F(1,14) = 11.36, p < .01."
Discussion¶
Related Claims¶
- Traditional challenge-navigation measures (level choice, replays, careful retries, hint reading, coding time) did not relate to learning outcomes
- In-game willingness to solve hard levels with complex code is positively associated with posttest coding knowledge, controlling for pretest
- Downgrading to simpler code after failure on personally hard levels is negatively associated with persistence on an unsolvable task — related
- In gamers' interview reports, sustained gaming engagement appeared closely related to controlling an optimal level of challenge: games too hard were often abandoned and games too easy lost their interest — related
- The simple machine used to solve a problem predicts persistence, ranked NONE < RAMP < PEN < LEVER < SB — related
Page metadata
| Field | Value |
|---|---|
type |
claim |
id |
relative-hards-solved-complex-predicts-challenge-time |
title |
Relative-Hards Solved Complex, a log measure of using complex code on personally difficult levels, predicts time spent on an unsolvable challenge task |
description |
Relative-Hards Solved Complex, a log measure of using complex code on personally difficult levels, predicts time spent on an unsolvable challenge task |
status |
review |
evidence_strength |
moderate |
newest_evidence |
2016 |
generated |
by process:wiki-ingest on 2026-10-16 |
trust |
unverified — no one has confirmed this page's content |
sources |
1 — malkiewich-2016 |
Frontmatter is the page's machine-readable record — see the Schema & Guide.