File: graph_score.c

package info (click to toggle)
gplanarity 17906-7
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 732 kB
  • sloc: ansic: 8,776; makefile: 131; perl: 17; sed: 2
file content (82 lines) | stat: -rw-r--r-- 2,419 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
 *
 *  gPlanarity: 
 *     The geeky little puzzle game with a big noodly crunch!
 *    
 *     gPlanarity copyright (C) 2005 Monty <monty@xiph.org>
 *     Original Flash game by John Tantalo <john.tantalo@case.edu>
 *     Original game concept by Mary Radcliffe
 *
 *  gPlanarity is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2, or (at your option)
 *  any later version.
 *   
 *  gPlanarity is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *   
 *  You should have received a copy of the GNU General Public License
 *  along with Postfish; see the file COPYING.  If not, write to the
 *  Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * 
 */

#include <string.h>
#include <stdio.h>
#include <math.h>
#include "graph.h"
#include "timer.h"
#include "nls.h"

static char objective_string[160];


int graphscore_get_raw_score(graph *g){
  return (int)ceil((g->original_intersections- g->active_intersections)*
		   g->intersection_mult);
}

int graphscore_get_multiplier_percent(graph *g){
  float obj_multiplier = 100;
  
  if(g->objective_lessthan)
    if(g->objective > g->active_intersections)
      obj_multiplier +=  100.f * g->objective_mult / g->objective * (g->objective - g->active_intersections);
  
  return ceil(obj_multiplier);
}

int graphscore_get_score(graph *g){
  return graphscore_get_raw_score(g)*graphscore_get_multiplier_percent(g)/100;
}

int graphscore_get_bonus(graph *g){
  int obj_multiplier = graphscore_get_multiplier_percent(g);
  
  if(get_timer()< g->original_intersections*g->intersection_mult)
    return ceil ((g->original_intersections*g->intersection_mult-get_timer()) * obj_multiplier / 100);
  
  return 0;
}

char *graphscore_objective_string(graph *g){
  if(g->objective == 0)
    return _("zero intersections");
  if(g->objective == 1){
    if(g->objective_lessthan){
      return _("1 intersection or fewer");
    }else{
      return _("1 intersection");
    }
  }else{
    snprintf(objective_string,160,_("%d intersections%s"),
	     g->objective,(g->objective_lessthan?
			_(" or fewer"):""));
    return objective_string;
  }
}