SciELO - Scientific Electronic Library Online

 
vol.1 número3Guaranteeing asymptotic zero intersampling tracking error via a discretized regulator and exponential holder for nonlinear systemsA pure nodal-analysis method suitable for analog circuits using nullors índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Journal of applied research and technology

versión On-line ISSN 2448-6736versión impresa ISSN 1665-6423

J. appl. res. technol vol.1 no.3 Ciudad de México dic. 2003

 

Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving

 

M.A. Murray-Lasso

 

Computer-Aided Teaching Unit, Department of Systems Engineering, Graduate School of Engineering, National University of Mexico, Ciudad Universitaria, Mexico City, D.F., 04510, Mexico.

 

Received: June 13th 2001.
Accepted: October 29th 2002.

 

Abstract

With the current interest in teaching problem-solving, it is important that the example problems that are presented to students have important educational value. Many mathematical puzzles, while requiring little specific background to be posed and remembered, are paradigms of important practical problems. If the teacher chooses the right puzzles, he/she not only will have motivated the student's interest, but will also have the opportunity of teaching powerful ideas that can be applied in a multitude of similar problems. Moreover the teacher will also be able to teach the corresponding solution algorithms and the way computers can be used as tools in problem-solving. The article presents these topics through an extensive example based on a well-known, apparently simple, wine-pouring puzzle that is intimately related to the concepts of state, shortest-routes and many management, engineering and industrial problems.

Keywords: Puzzles, Powerful Ideas, Algorithms, Computers, Problem-Solving, Paradigms, Graphs, States, Recursion, Shortest-Routes.

 

DESCARGAR ARTÍCULO EN FORMATO PDF

 

References

[1] Euler L., "The Seven Bridges of Königsberg ," in J. R. Newman (Ed.) Men and Numbers, Vol. I of the World of Mathematics, Simon and Schuster, New York, 1956, pp. 573 - 580.         [ Links ]

[2] Turnbull H. W., "The Great Mathematicians," in J. R. Newman (Ed.), Men and Numbers, Vol I of The World of Mathematics, Simon & Schuster, New York, 1956, pp. 75 - 178.         [ Links ]

[3] Ore O., "Pascal and the Invention of Probability Theory," Americal Mathematical Monthly, Vol 67, 1960, pp. 409- 416.         [ Links ]

[4] Newell A., Shaw J. C. & Simon H. A., "Chess Playing Programs and the Problem of Complexity," in E. A. Feigenbaum & Feldman J. Computers and Thought, Mc Graw-Hill Book Company, New York, 1963, pp. 39 - 70.         [ Links ]

[5] Kaufmann A. & Faure R., Introduction to Operations Research, Academic Press, New York, 1968.         [ Links ]

[6] Bellman R., Cooke K. L. & Lockett J. A., Algorithms, Graphs and Computers, Academic Press, New York, 1970.         [ Links ]

[7] Kaufmann A., Graphs, Dynamic Programming and Fintte Games, Academic Press, New York, 1967, pp. 255.         [ Links ]

[8] Dijkstra E. W., "A Note on Two Problems in Connection with Graphs," Numerische Matematik, Vol. 1,1959, pp. 269-271.         [ Links ]

[9] Dreyfus S., An Appraisal of Some Shortest Path Algorithms, RM-5433-PR, Rand Corporation, Santa Monica, CA, Oct., 1967.         [ Links ]

[10] Nilsson N. J., Problem-Solving Methods in Artificial Intelligence, Mc Graw-Hill Book Company, New York, 1971.         [ Links ]

[11] Murray-Lasso M. A. & Lara J., "Diseño de Árboles Optimos de Diagnóstico con Métodos de Inteligencia Artificial," Memoria del Primer Congreso de la Academia Nacional de Ingeniera, Guanajuato, 23 - 24 de junio, 1975, pp. 179-193.         [ Links ]

[12] Ahuja R. K., Magnanti T. L. & Orlin J. B., Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Upper Saddle River, NJ., 1993.         [ Links ]

[13] Huffman D. A., "A Method for the Construction of Minimum Redundancy Codes," Proceedings I. R. E., Vol. 40, no. 10, September, 1952, pp. 1098-1101.         [ Links ]

[14] Murray-Lasso M. A., "Aplicación de la Metodología de Árboles de Decisión e Información al Diagnóstico Médico," Revista Mexicana de Electricidad, Vol. 32, No. 383, 1972, pp.- 405-407, agosto, y No. 384, pp. 447-451 y 478-479, septiembre.         [ Links ] Also appeared in Boletin del Instituto Mexicano de Paaneación y Operación de Sistemas, Vol. 3, No. 14, nov. - dic. pp. 12-32.         [ Links ]

[15] Knuth D. E., The Art of Computer Programming. Vol. III, Sorting and Searching, Addison-Wesley Publishing Company, Reading, MA, 1973, pp. 365.         [ Links ]

[16] Cannon R. H. Jr., Dynamics of Physical Systems, Mc Graw-Hill Book Company, New York, 1967.         [ Links ]

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons