Game Rules and Instructions
Challenge to Professor Josegonzky


French Spanish

Go to Game

The game consists of removing sticks, in turn, so that the player who takes the last stick loses (i.e you win if your opponent is left with the last match). The rule is to get as many sticks as you want on every play, but in the same row. A Set has 5 games, then then after 3 Sets the session stops. the session stops. For another challenge, wait a few minutes.


The game takes place on the green surface with 15 sticks distributed in three rows of matches. The board  divided into two areas green and white. In the white area players who are playing or should play, and at the bottom of messages are displayed.

The three rows of matches arranged on the board divided into two areas.

The first row has 7 sticks, five sticks the second and third 3 stalks.


They are two opponents who take turns to draw matches. They are you, the Challenger represented by Boby puppy, and the other is the Professor. The rules is very simple. Each opponent takes turns to remove either matches from a row. You win if your opponent left with the last match.

The game consists of removing sticks in respective form, so that the player should take the last stick loses.

The rule is to get as many sticks as you want on every play, but in the same row.

The game should occur in 45 seconds (the option to select 20,45 and 60 seconds is given). If you delay in responding over that time, you lose.

The match is played in 3 sets that includes 5 games each one. Once completed more than 5 games and 3 sets, the application displays a message and close the session. This means that if you want to continue challenging the Professor must wait at least 5 minutes and re-enter the system. The idea of offering a limited number of games is to develop a strategy challenger and not try to win by trial and error, just looking for combinations, without a fee reasoning.

The program offers the option of choosing who starts. If you press on the word Help a window with the basic instructions are displayed.

If the icon is pressed a menu containing the Game Instructions (this document) and an option About ... pointing data about the software and languages is deployed.

If the icon is pressed again recharges the game.

If the icon is pressed the DocIRS Portal is deployed.

Note that the following message if the user tries to start dialing matches, without selecting who starts, appears:

In this window you can also choose who starts, just by clicking on one of the images.

Professor represents the computer program, which will automatically responding after each move.

Starting the Game

The user who wishes to challenge Professor, launches the game, choosing who starts. The game starts by clicking on the button or image on one of the two contenders.

By selecting who starts, clock immediately begin to run. The Take Away button appears in the middle of the white area.

The challenger mark the sticks by clicking on the (s) match (s). The selection will get yellow background. If you want to uncheck must click again on the match with a yellow background.


Once the selection marked, proceed to press the Take button, then choose who you play begins.

The Clock Runs

Therefore, the game has only 2 participants, Challenger versus Professor , who are taking matches turn, within 45 seconds (options of 20 or 60 seconds).

The Professor selection is being shown with green background.


Heading out there a winner and the game ends pointing Game Over. 

The game is fast lapsing, especially when the Professor plays, so that the challenger must react within a few seconds.

When one of the two contenders wins - that is left him one match to the other-then a message saying who won and asking if you want to view the log of the plays that were performed appears.

Indeed, when being a single match on the board, the game ends game. confirmation message is displayed, if the challenger press the OK button, the program displays the record played on a table with all the plays executed in the course of the game.

Lose by Time

When the game starts, the Challenger has the option to select the time between 45 and 60 seconds, as it deems appropriate. If you fail to finish selecting his moves within the time limit, the challenger loses.

To restart press the Start button again, which can be used at any time.

Educational Game, Mental Skill and Fun

Challenge to Professor Josegonzky, is to develop mental skills, based on finding the most convenient combinations to beat the opponent, leaving him on the board just a stick.

Games with rods or sticks, are the elements used ancestrally along more than 3,000 years in China. Therefore, this game is a variant of one of the dozens of riddles with rods that have been practiced in Asia.

The solution algorithm based on numerical method, developed José González Cornejo in 1995 and turned it into a computer software: "Challenge to Professor", which today has on Web, for all those who wish to challenge the system of Josegonzky.

The Riddler Professor Josegonzky, using chopsticks are a simple game, but it helps children learn and interact with the computer, thinking own combinations to win. Children enjoy having fun didactically.


Matchsticks "Challenge to Professor Josegonzky" is licensed under DocIRS Copyright Copyright (c) 1995, José Enrique González Cornejo

Author Algorithm  and  Software: José González Cornejo ~ DocIRS©2016

Related articles DocIRS:
Algoritmo de Arquímedes para el Cálculo de PI
¿Cómo entender el Teorema de Bayes en forma simple?
Algoritmo para el Cambio de Base Numérica
Descripción Algoritmo Cuadrados Mágicos Impares
Aplicación MagicoDocIRS v1.0 ~ Algoritmo Cuadrados Mágicos Impares
Logo DocIRS : Grafo conexo definido como árbol
Logit: Función de distribución dicotómica para el Scoring
Geometrías Cualitativas
El Profesor Josegonzky resuelve ganar al hipnotizador
Modelo de estimación del factor Fc ~ Acerca de variables de entorno
El Problema de la Ruta Óptima para Visitar Clientes (Simulador y Matrices)
Modelo Insumo-Producto, Costeo y Arquitectura de Negocios
Algoritmo Indicadores PMO
Fundamentos de los Lenguajes Estructurados.
Estimación de Precios de los Servicios-Productos DocIRS, Bajo el Modelo SAAS 
Complemento de Conceptos Matemáticos ~ Mínimos Cuadrados
Complemento de Conceptos Matemáticos ~ Regresión Múltiple
Complemento de Conceptos Matemáticos ~ Distancia de un Punto a una Recta
Descripción Algoritmo de Distribución Aleatoria de Suma 1
Algoritmo en Acción ~ Herramienta de Distribución Aleatoria de Suma 1
Por Tramos:Simulación Aleatoria de Algoritmo DocIRS para la Ruta Optima
Por Permutaciones:Simulación Aleatoria de Algoritmo DocIRS para la Ruta Optima
Ejemplo Simple Permutaciones para la Ruta Optima
Análisis de una función logarítmica asintótica en los Reales
Breve explicación Video Función de Producción DocIRS