Kovács, ZoltánHudi, István2024-09-042024-09-042007-06-01Teaching Mathematics and Computer Science, Vol. 5 No. 1 (2007) , 183-1931589-7389https://hdl.handle.net/2437/379604We deal with two problems in the set of 10-character-long strings. Both problems can be solved by slightly different methods, but our approach for each is brute force. As we point out, there can be differences in effectivity even in different brute force algorithms. As an additional result, we answer an open question of Raymond Smullyan's.application/pdfpuzzlesbrute forceC/C++ languagegraph algorithmsfolyóiratcikkOpen AccessZoltán Kovács and István Hudihttps://doi.org/10.5485/TMCS.2007.0160Teaching Mathematics and Computer Science15Teach. Math. Comp. Sci.2676-8364