• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
Javier Martinez

[Help] c++ Allegro, PuyoPuyo colors comparative?

4 posts in this topic

Hi all, im making a game in c++ and i have a problem.. well its not a problem but i want to know the best way to compare the colors with te row and the columns, the way im thinking is .. something like this.. : 

char board[7][7];

int row , col = 1;
int srch=1;
for(row=6;row>1;row--)
{
                  if (map[row][col]== map [row][col+srch] && map[row][col]== map [row][col+srch+1] && .....                   map[row][col+srch+3]== map [row][col+srch+4]) 
                  {
                        map[row][col]=' ';
                        ...
                        map[row][col+srch+4]=' ';
                  }
                  else
               else
            else....etc
{
srch++;
}
} ....

well something like that ....establishing all the possible IF opcions :S... but there is a easier way to detect the collisions?? like in c# bounds.intersect? ... as you can see, in the board, 1 is for RED, 2 is BLUE, 3 YELLOW, 4 Green .. when there are 4 or more of the same kind intersecting they're all destroyed.. so is a better way or function ? im using c++ and allegro.. thank you all for your help.

Edited by javiside
0

Share this post


Link to post
Share on other sites
from your code above i assume you're only interested in finding adjacent columns of the same color
in an array. it's not really an intersection problem i think.
so

231111134
121122344

would become

23_____34
121122344

you could look for the start and end of sequences of the same color. something like this would work:
 
int sequenceColor;
int startIndex;

for each row:
 for(int col = 0; col < numColumns; ++col) {
   int color = map[row, col];
   if(color != sequenceColor) {
     // new sequence begins, check if last sequence is long enough to clear
     int endIndex = col;
     if(endIndex - startIndex >= 4) {
        set map[row, i] = ' ', for i in [startIndex, ..., endIndex - 1]
     }

     startIndex = col; // start new sequence
     sequenceColor = color;
   }
 }
Edited by plainoldcj
0

Share this post


Link to post
Share on other sites

from your code above i assume you're only interested in finding adjacent columns of the same color
in an array. it's not really an intersection problem i think.
so

231111134
121122344

would become

23_____34
121122344

you could look for the start and end of sequences of the same color. something like this would work:
 

int sequenceColor;
int startIndex;

for each row:
 for(int col = 0; col < numColumns; ++col) {
   int color = map[row, col];
   if(color != sequenceColor) {
     // new sequence begins, check if last sequence is long enough to clear
     int endIndex = col;
     if(endIndex - startIndex >= 4) {
        set map[row, i] = ' ', for i in [startIndex, ..., endIndex - 1]
     }

     startIndex = col; // start new sequence
     sequenceColor = color;
   }
 }

Hi, thank you for your answer but im also looking for adjacent in the upper rows and then start again on the cols, but maybe saving the positions? in a new array? like in your example :

231111134 ---> 23_____34 saving (3,4,5,6,7) then compare in the upper row and if there is 1 delete too.. 

 

For instance:

if i have:

               

224133

123144             

221124

2311134

would become

 

__4_33

1_3___            

____2_

_3___3_

or maybe in the first loop will erase all the 2 then the 1 ,then all the 4 until there is no more equal adjacent

then those numbers will drop to look for combos or chains and would become:

______

______            

____3_

1334233

  and look again focoincidence but i dont think that would be a problem just running again the code. 

Thanks again.biggrin.png

0

Share this post


Link to post
Share on other sites

well something like that ....establishing all the possible IF opcions :S... but there is a easier way to detect the collisions??

This is important step in your growth as a programmer: When you realize what you have learned is infeasible here and that there must be an easier way. While it is certainly possible to code the logic entirely of IF-statements, it quickly becomes unmanageable and buggy. So, as a programmer, you must solve the problem in a generic way. For instance, the procedure could look something like this, in pseudo code:

1. For every unvisited tile on the board:
2.	For each unvisited neighbor of this tile:
3.		Visit each neighbor of the same color:
4.			Count and mark this neighbor tile
5.			Move to this tile and repeat step 2 for this neighbor tile
6.	If there are no more neighbors, and we have moved to this tile:
7.		Move back, and continue on step 5
8.	If we found four or more tiles of the same color neighboring this tile:
9.		Score and remove these tiles
Notice steps 2, 5, and 7: Recursion might be helpful here.
1

Share this post


Link to post
Share on other sites

This is important step in your growth as a programmer: When you realize what you have learned is infeasible here and that there must be an easier way. While it is certainly possible to code the logic entirely of IF-statements, it quickly becomes unmanageable and buggy. So, as a programmer, you must solve the problem in a generic way. For instance, the procedure could look something like this, in pseudo code:

1. For every unvisited tile on the board:2.	For each unvisited neighbor of this tile:3.		Visit each neighbor of the same color:4.			Count and mark this neighbor tile5.			Move to this tile and repeat step 2 for this neighbor tile6.	If there are no more neighbors, and we have moved to this tile:7.		Move back, and continue on step 58.	If we found four or more tiles of the same color neighboring this tile:9.		Score and remove these tiles
Notice steps 2, 5, and 7: Recursion might be helpful here.
Hi, thanks for the logic help :D I'll try thatsmile.png thank you again for the help biggrin.pngbiggrin.pngbiggrin.png Edited by javiside
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0