Metrics based plagarism monitoring
CCSC '01 Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges
Winnowing: local algorithms for document fingerprinting
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Desktop tools for offline plagiarism detection in computer programs
Informatics in education
Genetic algorithms for mentor-assisted evaluation function optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Plagiarism is a growing issue in the field of game-playing software. As new ideas and technologies are successfully implemented in free and commercial programs, they will be reused and revisited by later programs until they become standard, but on the other hand the same phenomenon can lead to accusations and claims of plagiarism, especially in competitive scenarios such as computer chess tournaments. Establishing whether a program is a "clone" or derivative of another can be a difficult and subjective task, left to the judgment of the individual expert and often resulting in a shade of gray rather than black and white verdicts. Tournaments judges and directors have to decide how similar is too similar on a case-by-case basis. This paper presents an objective framework under which similarities between game programs can be judged, using chess as a test case.