{"author_name":"Starspell","cat":"LD #31","comments":[],"epoch":1417887060,"likes":0,"metadata":{"p_key":"23948","p_author":"Starspell","p_authorkey":"1791","p_urlkey":"59349","p_title":"Grid Improvements","p_cat":"LD #31","p_event":"LD31","p_time":"1417887060","p_likes":"0","p_comments":"0","p_status":"UPD5","us_key":"1791","us_name":"Starspell","us_username":"\/author\/starspell\/","event_start":"1417737600","event_key":"26","event_name":"LD31"},"text":"

After researching how Bejeweled attacks the problems of filling the grid I have come up with a similar concept for filling mine. The difference is that I need to fill the grid with various chain lengths rather than the potential for groups of three or more that Bejewelled does. This has lead me to my implementation that now replaces the completely random distribution of single coloured tiles I had before:<\/p>\n

\"2nd\"<\/a><\/p>\n

You can see the difference in generation from my first screenshot post : http:\/\/ludumdare.com\/compo\/2014\/12\/05\/4-hours-in-11<\/span><\/span><\/a><\/p>\n

I’m going to have to play around with the algorithm and the settings to tweak the gameplay and generation but for now this is a more interesting playing field.<\/p>\n

Break time for lunch and then I’ll be working on the algorithm for creating replacement tile colours as the player \/ enemy move around the board. Then it’ll be time to implement the player and the enemy. After all that the only last mechanic is the scoring system.<\/p>\n

Then polish, polish, polish!<\/p>","time":"December 6th, 2014 12:31 pm","title":"Grid Improvements"}