Skip to content

Instantly share code, notes, and snippets.

View JannethAmaya's full-sized avatar

Janneth Amaya JannethAmaya

10 followers · 0 following
View GitHub Profile
@JannethAmaya
JannethAmaya / gist:a2b2283cac1d3855f044dad69ebaff90
Last active December 17, 2016 14:47
El problema de las N reinas
El problema de las N reinas consiste en situar N reinas en un tablero de ajedrez de N x N sin que se amenacen entre ellas.
*Cosas por considerar:
-Una reina amenaza a otra si esta en la misma fila, la misma columna o en la misma diagonal.
-Solamente N=2 y N=3 no tienen soluciones.
El programa debe aceptar como entrada el valor de N, y debe regresar el numero de soluciones posibles y las soluciones representadas del alguna manera (una matriz con 1’s representando a las reinas, un vector con las posiciones de las reinas,
o cualquier forma que quieras elegir y sea eficiente)
Para probar el numero de soluciones validas aquí esta el resultado esperado para los primeros 10 tamaños:
@JannethAmaya
JannethAmaya / pegman.md
Created October 31, 2016 17:06 — forked from fhernandezn/pegman.md
Pegman

Problem

While using Google Street View, you may have picked up and dropped the character Pegman before. Today, a mischievous user is going to place Pegman in some cell of a rectangular grid of unit cells with R rows and C columns. Each of the cells in this grid might be blank, or it might be labeled with an arrow pointing in one of four possible directions: up, right, down, or left.

When Pegman is placed on a grid cell, if that cell is blank, Pegman stands still forever. However, if that cell has an arrow, Pegman starts to walk in that direction. As he walks, whenever he encounters a blank cell, he just keeps walking in his current direction, but