Noorehan Yaacob

Noorehan Yaacob

Auto-generated profile, based on publicly available information

Noorehan Yaacob

STEM and Community Group, Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 May 2025
Verified
Book Chapter
Closed access
PDF file
HNHanis Nasir
Hanis Nasir
NANur Azura Noor Azhuan
Nur Azura Noor Azhuan
MAMohd Ariff Admon
Mohd Ariff Admon
SSSharidan Shafie
Sharidan Shafie
NYNoorehan Yaacob
Noorehan Yaacob

8 May 2025 in Semarak International Journal of STEM Education
Verified
Journal Article
Open access
SYsu hoe Su Yeak
su hoe Su Yeak
SSSuzarina Ahmed Sukri
Suzarina Ahmed Sukri
NYNoorehan Yaacob
Noorehan Yaacob
KTKeong Ang Tau
Keong Ang Tau
Mohammad Izat Emir ZulkiflyMohammad Izat Emir Zulkifly
Mohammad Izat Emir Zulkifly
MBMd faisal Md basir
Md faisal Md basir
Mastermind, a classic code-breaking game for two players, features various versions with differing numbers of code pegs (ranging from 4 to 6) and rules concerning repeated colours and blank pegs. This paper explores a simplified variant of Mastermind, where solutions are restricted to code pegs with unique colours and no blank pegs. By focusing on a subset of two code pegs, we model each attempt as a linear system. Through three attempts that satisfy the criteria of a linear system, we determine the initial colour solution for each small group. Further analysis allows for the calculation of the correct colours and their positions within each group using probability measurements. This approach provides a systematic method for solving the simplified Mastermind game and demonstrates the application of linear systems and probabilistic techniques in code-breaking. The findings offer insights into the effectiveness of these mathematical methods in deriving accurate solutions and enhancing problem-solving strategies within the game.

30 December 2024 in Semarak International Journal of STEM Education
Verified
Journal Article
Open access
PDF file
SYsu hoe Su Yeak
su hoe Su Yeak
SSSuzarina Ahmed Sukri
Suzarina Ahmed Sukri
NYNoorehan Yaacob
Noorehan Yaacob
KTKeong Ang Tau
Keong Ang Tau
Mohammad Izat Emir ZulkiflyMohammad Izat Emir Zulkifly
Mohammad Izat Emir Zulkifly
MBMd faisal Md basir
Md faisal Md basir
Mastermind, a classic code-breaking game for two players, features various versions with differing numbers of code pegs (ranging from 4 to 6) and rules concerning repeated colours and blank pegs. This paper explores a simplified variant of Mastermind, where solutions are restricted to code pegs with unique colours and no blank pegs. By focusing on a subset of two code pegs, we model each attempt as a linear system. Through three attempts that satisfy the criteria of a linear system, we determine the initial colour solution for each small group. Further analysis allows for the calculation of the correct colours and their positions within each group using probability measurements. This approach provides a systematic method for solving the simplified Mastermind game and demonstrates the application of linear systems and probabilistic techniques in code-breaking. The findings offer insights into the effectiveness of these mathematical methods in deriving accurate solutions and enhancing problem-solving strategies within the game.